00001 /*@HEADER 00002 // *********************************************************************** 00003 // 00004 // Ifpack: Object-Oriented Algebraic Preconditioner Package 00005 // Copyright (2002) Sandia Corporation 00006 // 00007 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive 00008 // license for use of this work by or on behalf of the U.S. Government. 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 Michael A. Heroux (maherou@sandia.gov) 00038 // 00039 // *********************************************************************** 00040 //@HEADER 00041 */ 00042 00043 #include "Ifpack_ConfigDefs.h" 00044 #include "Ifpack_DiagPreconditioner.h" 00045 #include "Epetra_BlockMap.h" 00046 #include "Epetra_Map.h" 00047 #include "Epetra_MultiVector.h" 00048 #include "Epetra_Vector.h" 00049 #include "Epetra_Comm.h" 00050 00051 // ============================================================================ 00052 Ifpack_DiagPreconditioner:: 00053 Ifpack_DiagPreconditioner(const Epetra_Map& DomainMap, 00054 const Epetra_Map& RangeMap, 00055 const Epetra_Vector& diag) : 00056 UseTranspose_(false), 00057 DomainMap_(DomainMap), 00058 RangeMap_(RangeMap), 00059 diag_(diag) 00060 { } 00061 00062 // ============================================================================ 00063 Ifpack_DiagPreconditioner::~Ifpack_DiagPreconditioner() 00064 { } 00065 00066 00067 // ============================================================================ 00068 int Ifpack_DiagPreconditioner::Apply(const Epetra_MultiVector& X, Epetra_MultiVector& Y) const 00069 { 00070 IFPACK_RETURN(-1); // not defined 00071 } 00072 00073 // ============================================================================ 00074 int Ifpack_DiagPreconditioner::ApplyInverse(const Epetra_MultiVector& X, Epetra_MultiVector& Y) const 00075 { 00076 if (X.NumVectors() != Y.NumVectors()) 00077 IFPACK_CHK_ERR(-1); 00078 00079 for (int v = 0; v < X.NumVectors(); ++v) 00080 for (int i = 0; i < X.MyLength(); ++i) 00081 Y[v][i] = diag_[i] * X[v][i]; 00083 00084 return(0); 00085 }
1.7.6.1