HomeSort by relevance Sort by last modified time
    Searched refs:pivrow (Results 1 - 4 of 4) sorted by null

  /external/eigen/Eigen/src/SparseLU/
SparseLU_pivotL.h 54 * \param[out] pivrow The pivot row
60 Index SparseLUImpl<Scalar,Index>::pivotL(const Index jcol, const RealScalar& diagpivotthresh, IndexVector& perm_r, IndexVector& iperm_c, Index& pivrow, GlobalLU_t& glu)
90 pivrow = lsub_ptr[pivptr];
91 perm_r(pivrow) = jcol;
107 pivrow = lsub_ptr[pivptr];
111 perm_r(pivrow) = jcol;
SparseLU_pruneL.h 39 * It prunes the L-structure of supernodes whose L-structure contains the current pivot row "pivrow"
44 * \param[out] pivrow The pivot row
53 void SparseLUImpl<Scalar,Index>::pruneL(const Index jcol, const IndexVector& perm_r, const Index pivrow, const Index nseg, const IndexVector& segrep, BlockIndexVector repfnz, IndexVector& xprune, GlobalLU_t& glu)
74 // If it has not been pruned & it has a nonz in row L(pivrow,i)
83 if (glu.lsub(krow) == pivrow)
107 // kmin below pivrow (not yet pivoted), and kmax
108 // above pivrow: interchange the two suscripts
SparseLUImpl.h 41 Index pivotL(const Index jcol, const RealScalar& diagpivotthresh, IndexVector& perm_r, IndexVector& iperm_c, Index& pivrow, GlobalLU_t& glu);
53 void pruneL(const Index jcol, const IndexVector& perm_r, const Index pivrow, const Index nseg, const IndexVector& segrep, BlockIndexVector repfnz, IndexVector& xprune, GlobalLU_t& glu);
SparseLU.h 547 Index pivrow; // Pivotal row number in the original row matrix local
613 info = Base::pivotL(jj, m_diagpivotthresh, m_perm_r.indices(), iperm_c.indices(), pivrow, m_glu);
626 if (pivrow != jj) m_detPermR *= -1;
629 Base::pruneL(jj, m_perm_r.indices(), pivrow, nseg, segrep, repfnz_k, xprune, m_glu);

Completed in 3651 milliseconds