All Downloads are FREE. Search and download functionalities are using the official Maven repository.

no.uib.cipr.matrix.LowerSPDBandMatrix Maven / Gradle / Ivy

Go to download

A comprehensive collection of matrix data structures, linear solvers, least squares methods, eigenvalue, and singular value decompositions.

There is a newer version: 1.0.4
Show newest version
/*
 * Copyright (C) 2003-2006 Bjørn-Ove Heimsund
 * 
 * This file is part of MTJ.
 * 
 * This library 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 2.1 of the License, or (at your
 * option) any later version.
 * 
 * This library 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 this library; if not, write to the Free Software Foundation,
 * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
 */

package no.uib.cipr.matrix;

/**
 * Lower symmetrical positive definite banded matrix. It does not enforce this
 * property (except for symmetry), and has the same storage layout as
 * {@link no.uib.cipr.matrix.LowerSymmBandMatrix LowerSymmBandMatrix}.
 */
public class LowerSPDBandMatrix extends LowerSymmBandMatrix {

    /**
     * Constructor for LowerSPDBandMatrix
     * 
     * @param n
     *            Size of the matrix. Since the matrix must be square, this
     *            equals both the number of rows and columns
     * @param kd
     *            Number of bands off the main diagonal (off diagonals)
     */
    public LowerSPDBandMatrix(int n, int kd) {
        super(n, kd);
    }

    /**
     * Constructor for LowerSPDBandMatrix
     * 
     * @param A
     *            Matrix to copy contents from. Only the parts of A
     *            that lie within the allocated band are copied over, the rest
     *            is ignored
     * @param kd
     *            Number of bands off the main diagonal (off diagonals)
     */
    public LowerSPDBandMatrix(Matrix A, int kd) {
        super(A, kd);
    }

    /**
     * Constructor for LowerSPDBandMatrix
     * 
     * @param A
     *            Matrix to copy contents from. Only the parts of A
     *            that lie within the allocated band are copied over, the rest
     *            is ignored
     * @param kd
     *            Number of bands off the main diagonal (off diagonals)
     * @param deep
     *            True for a deep copy. For shallow copies, A must
     *            be a banded matrix
     */
    public LowerSPDBandMatrix(Matrix A, int kd, boolean deep) {
        super(A, kd, deep);
    }

    @Override
    public LowerSPDBandMatrix copy() {
        return new LowerSPDBandMatrix(this, kd);
    }

    @Override
    public Matrix solve(Matrix B, Matrix X) {
        return SPDsolve(B, X);
    }

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy