1/* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2
3/*
4Copyright (C) 2009 Ralph Schreyer
5
6This file is part of QuantLib, a free-software/open-source library
7for financial quantitative analysts and developers - http://quantlib.org/
8
9QuantLib is free software: you can redistribute it and/or modify it
10under the terms of the QuantLib license. You should have received a
11copy of the license along with this program; if not, please email
12<quantlib-dev@lists.sf.net>. The license is also available online at
13<http://quantlib.org/license.shtml>.
14
15This program is distributed in the hope that it will be useful, but WITHOUT
16ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
17FOR A PARTICULAR PURPOSE. See the license for more details.
18*/
19
20/*! \file sparseilupreconditioner.hpp
21 \brief Preconditioner using the Incomplete LU algorithm and sparse matrices
22*/
23
24#ifndef quantlib_sparse_ilu_preconditioner_hpp
25#define quantlib_sparse_ilu_preconditioner_hpp
26
27#include <ql/math/array.hpp>
28#include <ql/math/matrixutilities/sparsematrix.hpp>
29
30namespace QuantLib {
31
32 /*! References:
33 Saad, Yousef. 1996, Iterative methods for sparse linear systems,
34 http://www-users.cs.umn.edu/~saad/books.html
35 */
36 class SparseILUPreconditioner {
37 public:
38 explicit SparseILUPreconditioner(const SparseMatrix& A, Integer lfil = 1);
39
40 const SparseMatrix& L() const;
41 const SparseMatrix& U() const;
42
43 Array apply(const Array& b) const;
44
45 private:
46 SparseMatrix L_, U_;
47 std::vector<Size> lBands_, uBands_;
48
49 Array forwardSolve(const Array& b) const;
50 Array backwardSolve(const Array& y) const;
51 };
52
53}
54
55#endif
56

source code of quantlib/ql/math/matrixutilities/sparseilupreconditioner.hpp