Library of Assembled Shared Sources
matrix_solve.h
Go to the documentation of this file.
1/** @file
2 * @author Bram de Greve (bram@cocamware.com)
3 * @author Tom De Muer (tom@cocamware.com)
4 *
5 * *** BEGIN LICENSE INFORMATION ***
6 *
7 * The contents of this file are subject to the Common Public Attribution License
8 * Version 1.0 (the "License"); you may not use this file except in compliance with
9 * the License. You may obtain a copy of the License at
10 * http://lass.sourceforge.net/cpal-license. The License is based on the
11 * Mozilla Public License Version 1.1 but Sections 14 and 15 have been added to cover
12 * use of software over a computer network and provide for limited attribution for
13 * the Original Developer. In addition, Exhibit A has been modified to be consistent
14 * with Exhibit B.
15 *
16 * Software distributed under the License is distributed on an "AS IS" basis, WITHOUT
17 * WARRANTY OF ANY KIND, either express or implied. See the License for the specific
18 * language governing rights and limitations under the License.
19 *
20 * The Original Code is LASS - Library of Assembled Shared Sources.
21 *
22 * The Initial Developer of the Original Code is Bram de Greve and Tom De Muer.
23 * The Original Developer is the Initial Developer.
24 *
25 * All portions of the code written by the Initial Developer are:
26 * Copyright (C) 2004-2011 the Initial Developer.
27 * All Rights Reserved.
28 *
29 * Contributor(s):
30 *
31 * Alternatively, the contents of this file may be used under the terms of the
32 * GNU General Public License Version 2 or later (the GPL), in which case the
33 * provisions of GPL are applicable instead of those above. If you wish to allow use
34 * of your version of this file only under the terms of the GPL and not to allow
35 * others to use your version of this file under the CPAL, indicate your decision by
36 * deleting the provisions above and replace them with the notice and other
37 * provisions required by the GPL License. If you do not delete the provisions above,
38 * a recipient may use your version of this file under either the CPAL or the GPL.
39 *
40 * *** END LICENSE INFORMATION ***
41 */
42
43
44
45#ifndef LASS_GUARDIAN_OF_INCLUSION_NUM_IMPL_MATRIX_SOLVE_H
46#define LASS_GUARDIAN_OF_INCLUSION_NUM_IMPL_MATRIX_SOLVE_H
47
48#include "../num_common.h"
49
50#include <cstddef>
51
52namespace lass
53{
54namespace num
55{
56namespace impl
57{
58
59template
60<
61 typename T,
62 typename RandomIterator1,
63 typename RandomIterator2
64>
65bool ludecomp(RandomIterator1 ioMatrix,
66 RandomIterator2 oIndex,
67 std::ptrdiff_t iSize,
68 int& iD);
69
70
71
72template
73<
74 typename T,
75 typename RandomIterator1,
76 typename RandomIterator2,
77 typename RandomIterator3
78>
79void lusolve(RandomIterator1 iMatrix,
80 RandomIterator2 iIndex,
81 RandomIterator3 ioColumn,
82 std::ptrdiff_t iSize);
83
84
85
86template
87<
88 typename T,
89 typename RandomIterator1,
90 typename RandomIterator2,
91 typename RandomIterator3,
92 typename RandomIterator4,
93 typename RandomIterator5
94>
95void lumprove(RandomIterator1 iMatrix,
96 RandomIterator2 iMatrixLU,
97 RandomIterator3 iIndex,
98 RandomIterator4 iColumn,
99 RandomIterator5 ioX,
100 std::ptrdiff_t iSize);
101
102
103
104template <typename T, typename RandomIterator1, typename RandomIterator2>
105bool cramer2(RandomIterator1 iMatrixRowMajor,
106 RandomIterator2 ioColumnFirst, RandomIterator2 ioColumnLast);
107
108template <typename T, typename RandomIterator1, typename RandomIterator2>
109bool cramer3(RandomIterator1 iMatrixRowMajor,
110 RandomIterator2 ioColumnFirst, RandomIterator2 ioColumnLast);
111
112
113
114
115template <typename T, typename RandomIterator1, typename RandomIterator2, typename RandomIterator3>
116bool solveTridiagonal(RandomIterator1 iA_1, RandomIterator1 iB_0, RandomIterator1 iC_0,
117 RandomIterator2 ioSolution, RandomIterator3 ioTemp, std::ptrdiff_t iSize);
118
119}
120
121}
122
123}
124
125#include "matrix_solve.inl"
126
127#endif
128
129// EOF
void lusolve(RandomIterator1 iMatrix, RandomIterator2 iIndex, RandomIterator3 ioColumn, std::ptrdiff_t iSize)
Solves the set of linear eqautions A X = B.
bool cramer2(RandomIterator1 iMatrixRowMajor, RandomIterator2 ioColumnFirst, RandomIterator2 ioColumnLast)
Solve A X = B for 2x2 matrices with Cramer's rule.
bool cramer3(RandomIterator1 iMatrixRowMajor, RandomIterator2 ioColumnFirst, RandomIterator2 ioColumnLast)
Solve A X = B for 3x3 matrices with Cramer's rule.
void lumprove(RandomIterator1 iMatrix, RandomIterator2 iMatrixLU, RandomIterator3 iIndex, RandomIterator4 iColumn, RandomIterator5 ioX, std::ptrdiff_t iSize)
Improves a solution vector X of the linear set of equations A X = B.
bool solveTridiagonal(RandomIterator1 iA_1, RandomIterator1 iB_0, RandomIterator1 iC_0, RandomIterator2 ioSolution, RandomIterator3 ioTemp, std::ptrdiff_t iSize)
Solve system of linear equations with a tridiagonal matrix.
bool ludecomp(RandomIterator1 ioMatrix, RandomIterator2 oIndex, std::ptrdiff_t iSize, int &iD)
Given a complex matrix iA, this routine replaces it by the LU decomposition of a rowwise permutation ...
numeric types and traits.
Definition basic_ops.h:70
Library for Assembled Shared Sources.
Definition config.h:53