File lapack_routines.cxx

Serial code to invert a complex tridiagonal system

Complex banded matrix solver

Solves a banded matrix given the matrix in compact form a[0…(n-1)][0…(m1+m2)] and the rhs vector b[0…(n-1)]

a is overwritten, and b is replaced by the solution

Copyright 2010 B.D.Dudson, S.Farley, M.V.Umansky, X.Q.Xu

Contact: Ben Dudson, bd512@york.ac.uk

This file is part of BOUT++.

BOUT++ is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

BOUT++ is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.

You should have received a copy of the GNU Lesser General Public License along with BOUT++. If not, see http://www.gnu.org/licenses/.

Functions

int tridag(const dcomplex*, const dcomplex*, const dcomplex*, const dcomplex*, dcomplex*, int)

Tri-diagonal complex matrix inversion.

bool tridag(const BoutReal*, const BoutReal*, const BoutReal*, const BoutReal*, BoutReal*, int)

Tri-diagonal matrix inversion (BoutReal)

void cyclic_tridag(BoutReal*, BoutReal*, BoutReal*, BoutReal*, BoutReal*, int)

Solve a cyclic tridiagonal matrix.

void cband_solve(Matrix<dcomplex>&, int, int, int, Array<dcomplex>&)

Complex band matrix solver.

void cyclic_tridag(dcomplex *a, dcomplex *b, dcomplex *c, dcomplex *r, dcomplex *x, int n)

Solve a cyclic tridiagonal matrix.