mirror of
https://gitlab.com/libeigen/eigen.git
synced 2026-04-10 11:34:33 +08:00
172 lines
6.6 KiB
C++
172 lines
6.6 KiB
C++
// This file is part of Eigen, a lightweight C++ template library
|
|
// for linear algebra.
|
|
//
|
|
// Copyright (C) 2012 Désiré Nuentsa-Wakam <desire.nuentsa_wakam@inria.fr>
|
|
//
|
|
// Eigen 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.
|
|
//
|
|
// Alternatively, you can redistribute it and/or
|
|
// modify it under the terms of the GNU General Public License as
|
|
// published by the Free Software Foundation; either version 2 of
|
|
// the License, or (at your option) any later version.
|
|
//
|
|
// Eigen 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 or the
|
|
// GNU General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Lesser General Public
|
|
// License and a copy of the GNU General Public License along with
|
|
// Eigen. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
/*
|
|
|
|
* NOTE: This file is the modified version of xpanel_bmod.c file in SuperLU
|
|
|
|
* -- SuperLU routine (version 3.0) --
|
|
* Univ. of California Berkeley, Xerox Palo Alto Research Center,
|
|
* and Lawrence Berkeley National Lab.
|
|
* October 15, 2003
|
|
*
|
|
* Copyright (c) 1994 by Xerox Corporation. All rights reserved.
|
|
*
|
|
* THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY
|
|
* EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK.
|
|
*
|
|
* Permission is hereby granted to use or copy this program for any
|
|
* purpose, provided the above notices are retained on all copies.
|
|
* Permission to modify the code and to distribute modified code is
|
|
* granted, provided the above notices are retained, and a notice that
|
|
* the code was modified is included with the above copyright notice.
|
|
*/
|
|
#ifndef SPARSELU_PANEL_BMOD_H
|
|
#define SPARSELU_PANEL_BMOD_H
|
|
/**
|
|
* \brief Performs numeric block updates (sup-panel) in topological order.
|
|
*
|
|
* Before entering this routine, the original nonzeros in the panel
|
|
* were already copied i nto the spa[m,w] ... FIXME to be checked
|
|
*
|
|
* \param m number of rows in the matrix
|
|
* \param w Panel size
|
|
* \param jcol Starting column of the panel
|
|
* \param nseg Number of segments in the U part
|
|
* \param dense Store the full representation of the panel
|
|
* \param tempv working array
|
|
* \param segrep segment representative... first row in the segment
|
|
* \param repfnz First nonzero rows
|
|
* \param glu Global LU data.
|
|
*
|
|
*
|
|
*/
|
|
template <typename DenseIndexBlock, typename IndexVector, typename ScalarVector>
|
|
void LU_panel_bmod(const int m, const int w, const int jcol, const int nseg, ScalarVector& dense, ScalarVector& tempv, DenseIndexBlock& segrep, DenseIndexBlock& repfnz, LU_GlobalLU_t<IndexVector,ScalarVector>& glu)
|
|
{
|
|
typedef typename ScalarVector::Scalar Scalar;
|
|
IndexVector& xsup = glu.xsup;
|
|
IndexVector& supno = glu.supno;
|
|
IndexVector& lsub = glu.lsub;
|
|
IndexVector& xlsub = glu.xlsub;
|
|
IndexVector& xlusup = glu.xlusup;
|
|
ScalarVector& lusup = glu.lusup;
|
|
|
|
int i,ksub,jj,nextl_col,irow;
|
|
int fsupc, nsupc, nsupr, nrow;
|
|
int krep, kfnz;
|
|
int lptr; // points to the row subscripts of a supernode
|
|
int luptr; // ...
|
|
int segsize,no_zeros,isub ;
|
|
// For each nonz supernode segment of U[*,j] in topological order
|
|
int k = nseg - 1;
|
|
for (ksub = 0; ksub < nseg; ksub++)
|
|
{ // For each updating supernode
|
|
|
|
/* krep = representative of current k-th supernode
|
|
* fsupc = first supernodal column
|
|
* nsupc = number of columns in a supernode
|
|
* nsupr = number of rows in a supernode
|
|
*/
|
|
krep = segrep(k); k--;
|
|
fsupc = xsup(supno(krep));
|
|
nsupc = krep - fsupc + 1;
|
|
nsupr = xlsub(fsupc+1) - xlsub(fsupc);
|
|
nrow = nsupr - nsupc;
|
|
lptr = xlsub(fsupc);
|
|
// NOTE : Unlike the original implementation in SuperLU, the present implementation
|
|
// does not include a 2-D block update.
|
|
|
|
// Sequence through each column in the panel
|
|
for (jj = jcol; jj < jcol + w; jj++)
|
|
{
|
|
nextl_col = (jj-jcol) * m;
|
|
VectorBlock<IndexVector> repfnz_col(repfnz, nextl_col, m); // First nonzero column index for each row
|
|
VectorBlock<ScalarVector> dense_col(dense, nextl_col, m); // Scatter/gather entire matrix column from/to here
|
|
|
|
kfnz = repfnz_col(krep);
|
|
if ( kfnz == IND_EMPTY )
|
|
continue; // skip any zero segment
|
|
|
|
segsize = krep - kfnz + 1;
|
|
luptr = xlusup(fsupc);
|
|
|
|
// NOTE : Unlike the original implementation in SuperLU,
|
|
// there is no update feature for col-col, 2col-col ...
|
|
|
|
// Perform a trianglar solve and block update,
|
|
// then scatter the result of sup-col update to dense[]
|
|
no_zeros = kfnz - fsupc;
|
|
// First Copy U[*,j] segment from dense[*] to tempv[*] :
|
|
// The result of triangular solve is in tempv[*];
|
|
// The result of matric-vector update is in dense_col[*]
|
|
isub = lptr + no_zeros;
|
|
for (i = 0; i < segsize; ++i)
|
|
{
|
|
irow = lsub(isub);
|
|
tempv(i) = dense_col(irow); // Gather to a compact vector
|
|
++isub;
|
|
}
|
|
// Start effective triangle
|
|
luptr += nsupr * no_zeros + no_zeros;
|
|
// triangular solve with Eigen
|
|
Map<Matrix<Scalar,Dynamic, Dynamic>, 0, OuterStride<> > A( &(lusup.data()[luptr]), segsize, segsize, OuterStride<>(nsupr) );
|
|
VectorBlock<ScalarVector> u(tempv, 0, segsize);
|
|
u = A.template triangularView<Lower>().solve(u);
|
|
|
|
luptr += segsize;
|
|
// Dense Matrix vector product y <-- A*x;
|
|
new (&A) Map<Matrix<Scalar,Dynamic, Dynamic>, 0, OuterStride<> > ( &(lusup.data()[luptr]), nrow, segsize, OuterStride<>(nsupr) );
|
|
VectorBlock<ScalarVector> l(tempv, segsize, nrow);
|
|
l= A * u;
|
|
|
|
// Scatter tempv(*) into SPA dense(*) such that tempv(*)
|
|
// can be used for the triangular solve of the next
|
|
// column of the panel. The y will be copied into ucol(*)
|
|
// after the whole panel has been finished... after column_dfs() and column_bmod()
|
|
|
|
isub = lptr + no_zeros;
|
|
for (i = 0; i < segsize; i++)
|
|
{
|
|
irow = lsub(isub);
|
|
dense_col(irow) = tempv(i);
|
|
tempv(i) = Scalar(0.0);
|
|
isub++;
|
|
}
|
|
|
|
// Scatter the update from &tempv[segsize] into SPA dense(*)
|
|
// Start dense rectangular L
|
|
for (i = 0; i < nrow; i++)
|
|
{
|
|
irow = lsub(isub);
|
|
dense_col(irow) -= l(i);
|
|
l(i) = Scalar(0);
|
|
++isub;
|
|
}
|
|
|
|
} // End for each column in the panel
|
|
|
|
} // End for each updating supernode
|
|
}
|
|
#endif |