The LaspackMatrix class wraps a QMatrix object from the Laspack library. More...

#include <laspack_matrix.h>

Inheritance diagram for libMesh::LaspackMatrix< T >:

Public Member Functions
	LaspackMatrix (const Parallel::Communicator &comm)
	Constructor; initializes the matrix to be empty, without any structure, i.e. More...

	LaspackMatrix (LaspackMatrix &&)=delete
	This class manages a C-style struct (QMatrix) manually, so we don't want to allow any automatic copy/move functions to be generated, and we can't default the destructor. More...

	LaspackMatrix (const LaspackMatrix &)=delete

LaspackMatrix &	operator= (const LaspackMatrix &)=delete

LaspackMatrix &	operator= (LaspackMatrix &&)=delete

virtual	~LaspackMatrix ()

virtual bool	need_full_sparsity_pattern () const override
	The `LaspackMatrix` needs the full sparsity pattern. More...

virtual void	update_sparsity_pattern (const SparsityPattern::Graph &) override
	Updates the matrix sparsity pattern. More...

virtual void	init (const numeric_index_type m, const numeric_index_type n, const numeric_index_type m_l, const numeric_index_type n_l, const numeric_index_type nnz=30, const numeric_index_type noz=10, const numeric_index_type blocksize=1) override
	Initialize SparseMatrix with the specified sizes. More...

virtual void	init (ParallelType=PARALLEL) override
	Initialize this matrix using the sparsity structure computed by `dof_map`. More...

virtual void	clear () override
	Restores the `SparseMatrix<T>` to a pristine state. More...

virtual void	zero () override
	Set all entries to 0. More...

virtual std::unique_ptr< SparseMatrix< T > >	zero_clone () const override

virtual std::unique_ptr< SparseMatrix< T > >	clone () const override

virtual void	close () override
	Calls the SparseMatrix's internal assembly routines, ensuring that the values are consistent across processors. More...

virtual numeric_index_type	m () const override

virtual numeric_index_type	n () const override

virtual numeric_index_type	row_start () const override

virtual numeric_index_type	row_stop () const override

virtual numeric_index_type	col_start () const override

virtual numeric_index_type	col_stop () const override

virtual void	set (const numeric_index_type i, const numeric_index_type j, const T value) override
	Set the element (i,j) to `value`. More...

virtual void	add (const numeric_index_type i, const numeric_index_type j, const T value) override
	Add `value` to the element (i,j). More...

virtual void	add_matrix (const DenseMatrix< T > &dm, const std::vector< numeric_index_type > &rows, const std::vector< numeric_index_type > &cols) override
	Add the full matrix `dm` to the SparseMatrix. More...

virtual void	add_matrix (const DenseMatrix< T > &dm, const std::vector< numeric_index_type > &dof_indices) override
	Same as `add_matrix`, but assumes the row and column maps are the same. More...

virtual void	add (const T a, const SparseMatrix< T > &X) override
	Compute A += a*X for scalar `a`, matrix `X`. More...

virtual T	operator() (const numeric_index_type i, const numeric_index_type j) const override

virtual Real	l1_norm () const override

virtual Real	linfty_norm () const override

virtual bool	closed () const override

virtual void	print_personal (std::ostream &os=libMesh::out) const override
	Print the contents of the matrix to the screen in a package-personalized style, if available. More...

virtual void	get_diagonal (NumericVector< T > &dest) const override
	Copies the diagonal part of the matrix into `dest`. More...

virtual void	get_transpose (SparseMatrix< T > &dest) const override
	Copies the transpose of the matrix into `dest`, which may be *this. More...

virtual void	get_row (numeric_index_type i, std::vector< numeric_index_type > &indices, std::vector< T > &values) const override
	Get a row from the matrix. More...

virtual bool	initialized () const

void	attach_dof_map (const DofMap &dof_map)
	Set a pointer to the `DofMap` to use. More...

void	attach_sparsity_pattern (const SparsityPattern::Build &sp)
	Set a pointer to a sparsity pattern to use. More...

virtual void	zero_rows (std::vector< numeric_index_type > &rows, T diag_value=0.0)
	Sets all row entries to 0 then puts `diag_value` in the diagonal entry. More...

virtual void	flush ()
	For PETSc matrix , this function is similar to close but without shrinking memory. More...

virtual numeric_index_type	local_m () const
	Get the number of rows owned by this process. More...

virtual numeric_index_type	local_n () const
	Get the number of columns owned by this process. More...

virtual void	add_block_matrix (const DenseMatrix< T > &dm, const std::vector< numeric_index_type > &brows, const std::vector< numeric_index_type > &bcols)
	Add the full matrix `dm` to the SparseMatrix. More...

virtual void	add_block_matrix (const DenseMatrix< T > &dm, const std::vector< numeric_index_type > &dof_indices)
	Same as `add_block_matrix()`, but assumes the row and column maps are the same. More...

virtual void	matrix_matrix_mult (SparseMatrix< T > &, SparseMatrix< T > &, bool)
	Compute Y = A*X for matrix `X`. More...

virtual void	add_sparse_matrix (const SparseMatrix< T > &, const std::map< numeric_index_type, numeric_index_type > &, const std::map< numeric_index_type, numeric_index_type > &, const T)
	Add `scalar` `spm` to the rows and cols of this matrix (A): A(rows[i], cols[j]) += scalar spm(i,j) More...

virtual std::size_t	n_nonzeros () const

void	print (std::ostream &os=libMesh::out, const bool sparse=false) const
	Print the contents of the matrix to the screen in a uniform style, regardless of matrix/solver package being used. More...

template<>
void	print (std::ostream &os, const bool sparse) const

virtual void	print_matlab (const std::string &="") const
	Print the contents of the matrix in Matlab's sparse matrix format. More...

virtual void	print_petsc_binary (const std::string &filename)
	Write the contents of the matrix to a file in PETSc's binary sparse matrix format. More...

virtual void	print_petsc_hdf5 (const std::string &filename)
	Write the contents of the matrix to a file in PETSc's HDF5 sparse matrix format. More...

virtual void	read_matlab (const std::string &filename)
	Read the contents of the matrix from Matlab's sparse matrix format. More...

virtual void	read_petsc_binary (const std::string &filename)
	Read the contents of the matrix from a file in PETSc's binary sparse matrix format. More...

virtual void	read_petsc_hdf5 (const std::string &filename)
	Read the contents of the matrix from a file in PETSc's HDF5 sparse matrix format. More...

virtual void	create_submatrix (SparseMatrix< T > &submatrix, const std::vector< numeric_index_type > &rows, const std::vector< numeric_index_type > &cols) const
	This function creates a matrix called "submatrix" which is defined by the row and column indices given in the "rows" and "cols" entries. More...

virtual void	create_submatrix_nosort (SparseMatrix< T > &, const std::vector< numeric_index_type > &, const std::vector< numeric_index_type > &) const
	Similar to the above function, this function creates a `submatrix` which is defined by the indices given in the `rows` and `cols` vectors. More...

virtual void	reinit_submatrix (SparseMatrix< T > &submatrix, const std::vector< numeric_index_type > &rows, const std::vector< numeric_index_type > &cols) const
	This function is similar to the one above, but it allows you to reuse the existing sparsity pattern of "submatrix" instead of reallocating it again. More...

void	vector_mult (NumericVector< T > &dest, const NumericVector< T > &arg) const
	Multiplies the matrix by the NumericVector `arg` and stores the result in NumericVector `dest`. More...

void	vector_mult_add (NumericVector< T > &dest, const NumericVector< T > &arg) const
	Multiplies the matrix by the NumericVector `arg` and adds the result to the NumericVector `dest`. More...

const Parallel::Communicator &	comm () const

processor_id_type	n_processors () const

processor_id_type	processor_id () const

Static Public Member Functions
static std::unique_ptr< SparseMatrix< T > >	build (const Parallel::Communicator &comm, const SolverPackage solver_package=libMesh::default_solver_package(), const MatrixBuildType matrix_build_type=MatrixBuildType::AUTOMATIC)
	Builds a `SparseMatrix<T>` using the linear solver package specified by `solver_package`. More...

static std::string	get_info ()
	Gets a string containing the reference information. More...

static void	print_info (std::ostream &out_stream=libMesh::out)
	Prints the reference information, by default to `libMesh::out`. More...

static unsigned int	n_objects ()
	Prints the number of outstanding (created, but not yet destroyed) objects. More...

static void	enable_print_counter_info ()
	Methods to enable/disable the reference counter output from print_info() More...

static void	disable_print_counter_info ()

Protected Types
typedef std::map< std::string, std::pair< unsigned int, unsigned int > >	Counts
	Data structure to log the information. More...

Protected Member Functions
virtual void	_get_submatrix (SparseMatrix< T > &, const std::vector< numeric_index_type > &, const std::vector< numeric_index_type > &, const bool) const
	Protected implementation of the create_submatrix and reinit_submatrix routines. More...

void	increment_constructor_count (const std::string &name) noexcept
	Increments the construction counter. More...

void	increment_destructor_count (const std::string &name) noexcept
	Increments the destruction counter. More...

Protected Attributes
DofMap const *	_dof_map
	The `DofMap` object associated with this object. More...

SparsityPattern::Build const *	_sp
	The `sparsity` pattern associated with this object. More...

bool	_is_initialized
	Flag indicating whether or not the matrix has been initialized. More...

const Parallel::Communicator &	_communicator

Static Protected Attributes
static Counts	_counts
	Actually holds the data. More...

static Threads::atomic< unsigned int >	_n_objects
	The number of objects. More...

static Threads::spin_mutex	_mutex
	Mutual exclusion object to enable thread-safe reference counting. More...

static bool	_enable_print_counter = true
	Flag to control whether reference count information is printed when print_info is called. More...

Private Member Functions
numeric_index_type	pos (const numeric_index_type i, const numeric_index_type j) const

Private Attributes
QMatrix	_QMat
	The Laspack sparse matrix pointer. More...

std::vector< numeric_index_type >	_csr
	The compressed row indices. More...

std::vector< std::vector< numeric_index_type >::const_iterator >	_row_start
	The start of each row in the compressed row index data structure. More...

bool	_closed
	Flag indicating if the matrix has been closed yet. More...

Friends
class	LaspackVector< T >
	Make other Laspack datatypes friends. More...

class	LaspackLinearSolver< T >

Detailed Description

template<typename T>
class libMesh::LaspackMatrix< T >

The LaspackMatrix class wraps a QMatrix object from the Laspack library.

Currently Laspack only supports real datatypes, so this class is a full specialization of SparseMatrix<T> with T = Real. All overridden virtual functions are documented in sparse_matrix.h.

Author: Benjamin S. Kirk

Date: 2003

Definition at line 56 of file laspack_matrix.h.

Member Typedef Documentation

◆ Counts

typedef std::map<std::string, std::pair<unsigned int, unsigned int> > libMesh::ReferenceCounter::Counts

protectedinherited

Data structure to log the information.

The log is identified by the class name.

Definition at line 119 of file reference_counter.h.

Constructor & Destructor Documentation

◆ LaspackMatrix() [1/3]

template<typename T >

libMesh::LaspackMatrix< T >::LaspackMatrix ( const Parallel::Communicator & comm )

Constructor; initializes the matrix to be empty, without any structure, i.e.

the matrix is not usable at all. This constructor is therefore only useful for matrices which are members of a class. All other matrices should be created at a point in the data flow where all necessary information is available.

You have to initialize the matrix before usage with init(...).

Definition at line 360 of file laspack_matrix.C.

                                                                   :
   SparseMatrix<T>(comm),
   _closed (false)
 {
 }

◆ LaspackMatrix() [2/3]

template<typename T>

libMesh::LaspackMatrix< T >::LaspackMatrix ( LaspackMatrix< T > && )

delete

This class manages a C-style struct (QMatrix) manually, so we don't want to allow any automatic copy/move functions to be generated, and we can't default the destructor.

◆ LaspackMatrix() [3/3]

template<typename T>

libMesh::LaspackMatrix< T >::LaspackMatrix ( const LaspackMatrix< T > & )

delete

◆ ~LaspackMatrix()

template<typename T >

libMesh::LaspackMatrix< T >::~LaspackMatrix ( )

virtual

Definition at line 369 of file laspack_matrix.C.

 {
   this->clear ();
 }

Member Function Documentation

◆ _get_submatrix()

template<typename T>

virtual void libMesh::SparseMatrix< T >::_get_submatrix	(	SparseMatrix< T > &	,
		const std::vector< numeric_index_type > &	,
		const std::vector< numeric_index_type > &	,
		const bool
	)		const

inlineprotectedvirtualinherited

Protected implementation of the create_submatrix and reinit_submatrix routines.

Note: This function must be overridden in derived classes for it to work properly!

Reimplemented in libMesh::PetscMatrix< T >.

Definition at line 555 of file sparse_matrix.h.

Referenced by libMesh::SparseMatrix< ValOut >::create_submatrix(), and libMesh::SparseMatrix< ValOut >::reinit_submatrix().

   {
     libmesh_not_implemented();
   }

◆ add() [1/2]

template<typename T >

void libMesh::LaspackMatrix< T >::add	(	const numeric_index_type	i,
		const numeric_index_type	j,
		const T	value
	)

overridevirtual

Add value to the element (i,j).

Throws an error if the entry does not exist. Zero values can be "added" to non-existent entries.

Implements libMesh::SparseMatrix< T >.

Definition at line 526 of file laspack_matrix.C.

References libMesh::initialized(), libMesh::libmesh_assert(), and value.

 {
   libmesh_assert (this->initialized());
   libmesh_assert_less (i, this->m());
   libmesh_assert_less (j, this->n());
 
   const numeric_index_type position = this->pos(i,j);
 
   // Sanity check
   libmesh_assert_equal_to (*(_row_start[i]+position), j);
 
   Q_AddVal (&_QMat, i+1, position, value);
 }

◆ add() [2/2]

template<typename T >

void libMesh::LaspackMatrix< T >::add	(	const T	a,
		const SparseMatrix< T > &	X
	)

overridevirtual

Compute A += a*X for scalar a, matrix X.

Note: LASPACK does not provide a true axpy for matrices, so a hand-coded version with hopefully acceptable performance is provided.

Implements libMesh::SparseMatrix< T >.

Definition at line 554 of file laspack_matrix.C.

References libMesh::initialized(), libMesh::libmesh_assert(), libMesh::SparseMatrix< T >::m(), libMesh::SparseMatrix< T >::n(), and value.

 {
   libmesh_assert (this->initialized());
   libmesh_assert_equal_to (this->m(), X_in.m());
   libmesh_assert_equal_to (this->n(), X_in.n());
 
   const LaspackMatrix<T> * X =
     cast_ptr<const LaspackMatrix<T> *> (&X_in);
 
   _LPNumber a = static_cast<_LPNumber> (a_in);
 
   libmesh_assert(X);
 
   // loops taken from LaspackMatrix<T>::zero ()
 
   const numeric_index_type n_rows = this->m();
 
   for (numeric_index_type row=0; row<n_rows; row++)
     {
       auto r_start = _row_start[row];
 
       const numeric_index_type len = (_row_start[row+1] - _row_start[row]);
 
       // Make sure we agree on the row length
       libmesh_assert_equal_to (len, Q_GetLen(&_QMat, row+1));
       // compare matrix sparsity structures
       libmesh_assert_equal_to (len, Q_GetLen(&(X->_QMat), row+1));
 
 
       for (numeric_index_type l=0; l<len; l++)
         {
           const numeric_index_type j = *(r_start + l);
 
           // Make sure the data structures are working
           libmesh_assert_equal_to ((j+1), Q_GetPos (&_QMat, row+1, l));
 
           const _LPNumber value = a * Q_GetEl(const_cast<QMatrix*>(&(X->_QMat)), row+1, j+1);
           Q_AddVal   (&_QMat, row+1, l, value);
         }
     }
 }

◆ add_block_matrix() [1/2]

template<typename T>

void libMesh::SparseMatrix< T >::add_block_matrix	(	const DenseMatrix< T > &	dm,
		const std::vector< numeric_index_type > &	brows,
		const std::vector< numeric_index_type > &	bcols
	)

virtualinherited

Add the full matrix dm to the SparseMatrix.

This is useful for adding an element matrix at assembly time. The matrix is assumed blocked, and brow, bcol correspond to the block row and column indices.

Reimplemented in libMesh::PetscMatrix< T >.

Definition at line 82 of file sparse_matrix.C.

Referenced by libMesh::SparseMatrix< ValOut >::add_block_matrix().

 {
   libmesh_assert_equal_to (dm.m() / brows.size(), dm.n() / bcols.size());
 
   const numeric_index_type blocksize = cast_int<numeric_index_type>
     (dm.m() / brows.size());
 
   libmesh_assert_equal_to (dm.m()%blocksize, 0);
   libmesh_assert_equal_to (dm.n()%blocksize, 0);
 
   std::vector<numeric_index_type> rows, cols;
 
   rows.reserve(blocksize*brows.size());
   cols.reserve(blocksize*bcols.size());
 
   for (auto & row : brows)
     {
       numeric_index_type i = row * blocksize;
 
       for (unsigned int v=0; v<blocksize; v++)
         rows.push_back(i++);
     }
 
   for (auto & col : bcols)
     {
       numeric_index_type j = col * blocksize;
 
       for (unsigned int v=0; v<blocksize; v++)
         cols.push_back(j++);
     }
 
   this->add_matrix (dm, rows, cols);
 }

◆ add_block_matrix() [2/2]

template<typename T>

virtual void libMesh::SparseMatrix< T >::add_block_matrix	(	const DenseMatrix< T > &	dm,
		const std::vector< numeric_index_type > &	dof_indices
	)

inlinevirtualinherited

Same as add_block_matrix(), but assumes the row and column maps are the same.

Thus the matrix dm must be square.

Reimplemented in libMesh::PetscMatrix< T >.

Definition at line 308 of file sparse_matrix.h.

310 { this->add_block_matrix (dm, dof_indices, dof_indices); }

libMesh::SparseMatrix::add_block_matrix

virtual void add_block_matrix(const DenseMatrix< T > &dm, const std::vector< numeric_index_type > &brows, const std::vector< numeric_index_type > &bcols)

Add the full matrix dm to the SparseMatrix.

Definition: sparse_matrix.C:82

◆ add_matrix() [1/2]

template<typename T >

void libMesh::LaspackMatrix< T >::add_matrix	(	const DenseMatrix< T > &	dm,
		const std::vector< numeric_index_type > &	rows,
		const std::vector< numeric_index_type > &	cols
	)

overridevirtual

Add the full matrix dm to the SparseMatrix.

This is useful for adding an element matrix at assembly time.

Implements libMesh::SparseMatrix< T >.

Definition at line 259 of file laspack_matrix.C.

References libMesh::initialized(), libMesh::libmesh_assert(), libMesh::DenseMatrixBase< T >::m(), and libMesh::DenseMatrixBase< T >::n().

 {
   libmesh_assert (this->initialized());
   unsigned int n_rows = cast_int<unsigned int>(rows.size());
   unsigned int n_cols = cast_int<unsigned int>(cols.size());
   libmesh_assert_equal_to (dm.m(), n_rows);
   libmesh_assert_equal_to (dm.n(), n_cols);
 
 
   for (unsigned int i=0; i<n_rows; i++)
     for (unsigned int j=0; j<n_cols; j++)
       this->add(rows[i],cols[j],dm(i,j));
 }

◆ add_matrix() [2/2]

template<typename T >

void libMesh::LaspackMatrix< T >::add_matrix	(	const DenseMatrix< T > &	dm,
		const std::vector< numeric_index_type > &	dof_indices
	)

overridevirtual

Same as add_matrix, but assumes the row and column maps are the same.

Thus the matrix dm must be square.

Implements libMesh::SparseMatrix< T >.

Definition at line 545 of file laspack_matrix.C.

 {
   this->add_matrix (dm, dof_indices, dof_indices);
 }

◆ add_sparse_matrix()

template<typename T>

virtual void libMesh::SparseMatrix< T >::add_sparse_matrix	(	const SparseMatrix< T > &	,
		const std::map< numeric_index_type, numeric_index_type > &	,
		const std::map< numeric_index_type, numeric_index_type > &	,
		const T
	)

inlinevirtualinherited

Add scalar* spm to the rows and cols of this matrix (A): A(rows[i], cols[j]) += scalar * spm(i,j)

Reimplemented in libMesh::PetscMatrix< T >.

Definition at line 327 of file sparse_matrix.h.

331 { libmesh_not_implemented(); }

◆ attach_dof_map()

template<typename T >

void libMesh::SparseMatrix< T >::attach_dof_map ( const DofMap & dof_map )

inherited

Set a pointer to the DofMap to use.

If a separate sparsity pattern is not being used, use the one from the DofMap.

The lifetime of dof_map must exceed the lifetime of this.

Definition at line 63 of file sparse_matrix.C.

Referenced by libMesh::__libmesh_tao_hessian(), and libMesh::DofMap::update_sparsity_pattern().

 {
   _dof_map = &dof_map;
   if (!_sp)
     _sp = dof_map.get_sparsity_pattern();
 }

◆ attach_sparsity_pattern()

template<typename T >

void libMesh::SparseMatrix< T >::attach_sparsity_pattern ( const SparsityPattern::Build & sp )

inherited

Set a pointer to a sparsity pattern to use.

Useful in cases where a matrix requires a wider (or for efficiency narrower) pattern than most matrices in the system, or in cases where no system sparsity pattern is being calculated by the DofMap.

The lifetime of sp must exceed the lifetime of this.

Definition at line 73 of file sparse_matrix.C.

Referenced by libMesh::DofMap::update_sparsity_pattern().

 {
   _sp = &sp;
 }

◆ build()

template<typename T >

std::unique_ptr< SparseMatrix< T > > libMesh::SparseMatrix< T >::build	(	const Parallel::Communicator &	comm,
		const SolverPackage	solver_package = `libMesh::default_solver_package()`,
		const MatrixBuildType	matrix_build_type = `MatrixBuildType::AUTOMATIC`
	)

staticinherited

Builds a SparseMatrix<T> using the linear solver package specified by solver_package.

Definition at line 156 of file sparse_matrix.C.

Referenced by libMesh::TransientRBConstruction::allocate_data_structures(), libMesh::RBConstruction::allocate_data_structures(), libMesh::DofMap::process_mesh_constraint_rows(), ConstraintOperatorTest::test1DCoarseningNewNodes(), ConstraintOperatorTest::test1DCoarseningOperator(), ConstraintOperatorTest::testCoreform(), SystemsTest::testProjectMatrix1D(), SystemsTest::testProjectMatrix2D(), and SystemsTest::testProjectMatrix3D().

 {
   // Avoid unused parameter warnings when no solver packages are enabled.
   libmesh_ignore(comm);
 
   if (matrix_build_type == MatrixBuildType::DIAGONAL)
     return std::make_unique<DiagonalMatrix<T>>(comm);
 
   // Build the appropriate vector
   switch (solver_package)
     {
 
 #ifdef LIBMESH_HAVE_LASPACK
     case LASPACK_SOLVERS:
       return std::make_unique<LaspackMatrix<T>>(comm);
 #endif
 
 
 #ifdef LIBMESH_HAVE_PETSC
     case PETSC_SOLVERS:
       return std::make_unique<PetscMatrix<T>>(comm);
 #endif
 
 
 #ifdef LIBMESH_TRILINOS_HAVE_EPETRA
     case TRILINOS_SOLVERS:
       return std::make_unique<EpetraMatrix<T>>(comm);
 #endif
 
 
 #ifdef LIBMESH_HAVE_EIGEN
     case EIGEN_SOLVERS:
       return std::make_unique<EigenSparseMatrix<T>>(comm);
 #endif
 
     default:
       libmesh_error_msg("ERROR:  Unrecognized solver package: " << solver_package);
     }
 }

◆ clear()

template<typename T >

void libMesh::LaspackMatrix< T >::clear ( )

overridevirtual

Restores the SparseMatrix<T> to a pristine state.

Implements libMesh::SparseMatrix< T >.

Definition at line 377 of file laspack_matrix.C.

References libMesh::libMeshPrivateData::_is_initialized, and libMesh::initialized().

 {
   if (this->initialized())
     {
       Q_Destr(&_QMat);
     }
 
   _csr.clear();
   _row_start.clear();
   _closed = false;
   this->_is_initialized = false;
 }

◆ clone()

template<typename T >

std::unique_ptr< SparseMatrix< T > > libMesh::LaspackMatrix< T >::clone ( ) const

overridevirtual

Returns: A smart pointer to a copy of this matrix.

Note: This must be overridden in the derived classes.

Implements libMesh::SparseMatrix< T >.

Definition at line 441 of file laspack_matrix.C.

 {
   // We don't currently have a faster implementation than making a
   // zero clone and then filling in the values.
   auto mat_copy = this->zero_clone();
   mat_copy->add(1., *this);
 
   // Work around an issue on older compilers.  We are able to simply
   // "return mat_copy;" on newer compilers
   return std::unique_ptr<SparseMatrix<T>>(mat_copy.release());
 }

◆ close()

template<typename T >

void libMesh::LaspackMatrix< T >::close ( )

overridevirtual

Calls the SparseMatrix's internal assembly routines, ensuring that the values are consistent across processors.

Implements libMesh::SparseMatrix< T >.

Definition at line 637 of file laspack_matrix.C.

References libMesh::initialized(), and libMesh::libmesh_assert().

Referenced by libMesh::LaspackLinearSolver< T >::adjoint_solve(), and libMesh::LaspackLinearSolver< T >::solve().

 {
   libmesh_assert(this->initialized());
 
   this->_closed = true;
 
   // We've probably changed some entries so we need to tell LASPACK
   // that cached data is now invalid.
   *_QMat.DiagElAlloc = _LPFalse;
   *_QMat.ElSorted = _LPFalse;
   if (*_QMat.ILUExists)
     {
       *_QMat.ILUExists = _LPFalse;
       Q_Destr(_QMat.ILU);
     }
 }

◆ closed()

template<typename T>

virtual bool libMesh::LaspackMatrix< T >::closed ( ) const

inlineoverridevirtual

Returns: true if the matrix has been assembled.

Implements libMesh::SparseMatrix< T >.

Definition at line 159 of file laspack_matrix.h.

References libMesh::LaspackMatrix< T >::_closed.

159 { return _closed; }

libMesh::LaspackMatrix::_closed

bool _closed

Flag indicating if the matrix has been closed yet.

Definition: laspack_matrix.h:199

◆ col_start()

template<typename T >

numeric_index_type libMesh::LaspackMatrix< T >::col_start ( ) const

overridevirtual

Returns: The index of the first matrix column owned by this processor.

Implements libMesh::SparseMatrix< T >.

Definition at line 490 of file laspack_matrix.C.

 {
   return 0;
 }

◆ col_stop()

template<typename T >

numeric_index_type libMesh::LaspackMatrix< T >::col_stop ( ) const

overridevirtual

Returns: The index of the last matrix column (+1) owned by this processor.

Implements libMesh::SparseMatrix< T >.

Definition at line 498 of file laspack_matrix.C.

 {
   return this->n();
 }

◆ comm()

const Parallel::Communicator& libMesh::ParallelObject::comm ( ) const

inlineinherited

Returns: A reference to the Parallel::Communicator object used by this mesh.

Definition at line 97 of file parallel_object.h.

References libMesh::ParallelObject::_communicator.

98 { return _communicator; }

libMesh::ParallelObject::_communicator

const Parallel::Communicator & _communicator

Definition: parallel_object.h:120

◆ create_submatrix()

template<typename T>

virtual void libMesh::SparseMatrix< T >::create_submatrix	(	SparseMatrix< T > &	submatrix,
		const std::vector< numeric_index_type > &	rows,
		const std::vector< numeric_index_type > &	cols
	)		const

inlinevirtualinherited

This function creates a matrix called "submatrix" which is defined by the row and column indices given in the "rows" and "cols" entries.

Currently this operation is only defined for the PetscMatrix type. Note: The rows and cols vectors need to be sorted; Use the nosort version below if rows and cols vectors are not sorted; The rows and cols only contain indices that are owned by this processor.

Definition at line 469 of file sparse_matrix.h.

Referenced by libMesh::libmesh_petsc_DMCreateInterpolation(), and libMesh::CondensedEigenSystem::solve().

   {
     this->_get_submatrix(submatrix,
                          rows,
                          cols,
                          false); // false means DO NOT REUSE submatrix
   }

◆ create_submatrix_nosort()

template<typename T>

virtual void libMesh::SparseMatrix< T >::create_submatrix_nosort	(	SparseMatrix< T > &	,
		const std::vector< numeric_index_type > &	,
		const std::vector< numeric_index_type > &
	)		const

inlinevirtualinherited

Similar to the above function, this function creates a submatrix which is defined by the indices given in the rows and cols vectors.

Note: Both rows and cols can be unsorted; Use the above function for better efficiency if your indices are sorted; rows and cols can contain indices that are owned by other processors.

Reimplemented in libMesh::PetscMatrix< T >.

Definition at line 487 of file sparse_matrix.h.

   {
     libmesh_not_implemented();
   }

◆ disable_print_counter_info()

void libMesh::ReferenceCounter::disable_print_counter_info ( )

staticinherited

Definition at line 100 of file reference_counter.C.

References libMesh::ReferenceCounter::_enable_print_counter.

 {
   _enable_print_counter = false;
   return;
 }

◆ enable_print_counter_info()

void libMesh::ReferenceCounter::enable_print_counter_info ( )

staticinherited

Methods to enable/disable the reference counter output from print_info()

Definition at line 94 of file reference_counter.C.

References libMesh::ReferenceCounter::_enable_print_counter.

 {
   _enable_print_counter = true;
   return;
 }

◆ flush()

template<typename T>

virtual void libMesh::SparseMatrix< T >::flush ( )

inlinevirtualinherited

For PETSc matrix , this function is similar to close but without shrinking memory.

This is useful when we want to switch between ADD_VALUES and INSERT_VALUES. close should be called before using the matrix.

Reimplemented in libMesh::PetscMatrix< T >, and libMesh::PetscMatrix< libMesh::Number >.

Definition at line 215 of file sparse_matrix.h.

215 { close(); }

libMesh::SparseMatrix::close

virtual void close()=0

Calls the SparseMatrix's internal assembly routines, ensuring that the values are consistent across p...

◆ get_diagonal()

template<typename T >

void libMesh::LaspackMatrix< T >::get_diagonal ( NumericVector< T > & dest ) const

overridevirtual

Copies the diagonal part of the matrix into dest.

Implements libMesh::SparseMatrix< T >.

Definition at line 314 of file laspack_matrix.C.

 {
   libmesh_not_implemented();
 }

◆ get_info()

std::string libMesh::ReferenceCounter::get_info ( )

staticinherited

Gets a string containing the reference information.

Definition at line 47 of file reference_counter.C.

References libMesh::ReferenceCounter::_counts, and libMesh::Quality::name().

Referenced by libMesh::ReferenceCounter::print_info().

 {
 #if defined(LIBMESH_ENABLE_REFERENCE_COUNTING) && defined(DEBUG)
 
   std::ostringstream oss;
 
   oss << '\n'
       << " ---------------------------------------------------------------------------- \n"
       << "| Reference count information                                                |\n"
       << " ---------------------------------------------------------------------------- \n";
 
   for (const auto & [name, cd] : _counts)
     oss << "| " << name << " reference count information:\n"
         << "|  Creations:    " << cd.first    << '\n'
         << "|  Destructions: " << cd.second << '\n';
 
   oss << " ---------------------------------------------------------------------------- \n";
 
   return oss.str();
 
 #else
 
   return "";
 
 #endif
 }

◆ get_row()

template<typename T >

void libMesh::LaspackMatrix< T >::get_row	(	numeric_index_type	i,
		std::vector< numeric_index_type > &	indices,
		std::vector< T > &	values
	)		const

overridevirtual

Get a row from the matrix.

Parameters

i	The matrix row to get
indices	A container that will be filled with the column indices corresponding to (possibly) non-zero values
values	A container holding the column values

Implements libMesh::SparseMatrix< T >.

Definition at line 330 of file laspack_matrix.C.

 {
   indices.clear();
   values.clear();
 
   const numeric_index_type len = (_row_start[i+1] - _row_start[i]);
 
   // Make sure we agree on the row length
   libmesh_assert_equal_to (len, Q_GetLen(&_QMat, i+1));
 
   auto r_start = _row_start[i];
 
   for (numeric_index_type l=0; l<len; l++)
     {
       const numeric_index_type j = *(r_start + l);
 
       // Make sure the data structures are working
       libmesh_assert_equal_to ((j+1), Q_GetPos (&_QMat, i+1, l));
 
       indices.push_back(j);
 
       values.push_back(Q_GetVal (&_QMat, i+1, l));
     }
 }

◆ get_transpose()

template<typename T >

void libMesh::LaspackMatrix< T >::get_transpose ( SparseMatrix< T > & dest ) const

overridevirtual

Copies the transpose of the matrix into dest, which may be *this.

Implements libMesh::SparseMatrix< T >.

Definition at line 322 of file laspack_matrix.C.

 {
   libmesh_not_implemented();
 }

◆ increment_constructor_count()

void libMesh::ReferenceCounter::increment_constructor_count ( const std::string & name )

inlineprotectednoexceptinherited

Increments the construction counter.

Should be called in the constructor of any derived class that will be reference counted.

Definition at line 183 of file reference_counter.h.

References libMesh::err, libMesh::BasicOStreamProxy< charT, traits >::get(), libMesh::Quality::name(), and libMesh::Threads::spin_mtx.

Referenced by libMesh::ReferenceCountedObject< RBParametrized >::ReferenceCountedObject().

 {
   libmesh_try
   {
     Threads::spin_mutex::scoped_lock lock(Threads::spin_mtx);
     std::pair<unsigned int, unsigned int> & p = _counts[name];
     p.first++;
   }
   libmesh_catch (...)
   {
     auto stream = libMesh::err.get();
     stream->exceptions(stream->goodbit); // stream must not throw
     libMesh::err << "Encountered unrecoverable error while calling "
                  << "ReferenceCounter::increment_constructor_count() "
                  << "for a(n) " << name << " object." << std::endl;
     std::terminate();
   }
 }

◆ increment_destructor_count()

void libMesh::ReferenceCounter::increment_destructor_count ( const std::string & name )

inlineprotectednoexceptinherited

Increments the destruction counter.

Should be called in the destructor of any derived class that will be reference counted.

Definition at line 207 of file reference_counter.h.

References libMesh::err, libMesh::BasicOStreamProxy< charT, traits >::get(), libMesh::Quality::name(), and libMesh::Threads::spin_mtx.

Referenced by libMesh::ReferenceCountedObject< RBParametrized >::~ReferenceCountedObject().

 {
   libmesh_try
   {
     Threads::spin_mutex::scoped_lock lock(Threads::spin_mtx);
     std::pair<unsigned int, unsigned int> & p = _counts[name];
     p.second++;
   }
   libmesh_catch (...)
   {
     auto stream = libMesh::err.get();
     stream->exceptions(stream->goodbit); // stream must not throw
     libMesh::err << "Encountered unrecoverable error while calling "
                  << "ReferenceCounter::increment_destructor_count() "
                  << "for a(n) " << name << " object." << std::endl;
     std::terminate();
   }
 }

◆ init() [1/2]

template<typename T >

void libMesh::LaspackMatrix< T >::init	(	const numeric_index_type	m,
		const numeric_index_type	n,
		const numeric_index_type	m_l,
		const numeric_index_type	n_l,
		const numeric_index_type	nnz = `30`,
		const numeric_index_type	noz = `10`,
		const numeric_index_type	blocksize = `1`
	)

overridevirtual

Initialize SparseMatrix with the specified sizes.

Parameters

m	The global number of rows.
n	The global number of columns.
m_l	The local number of rows.
n_l	The local number of columns.
nnz	The number of on-diagonal nonzeros per row (defaults to 30).
noz	The number of off-diagonal nonzeros per row (defaults to 10).
blocksize	Optional value indicating dense coupled blocks for systems with multiple variables all of the same type.

Implements libMesh::SparseMatrix< T >.

Definition at line 128 of file laspack_matrix.C.

References libMesh::libMeshPrivateData::_is_initialized, libMesh::libmesh_assert(), and libMesh::make_range().

 {
   // noz ignored...  only used for multiple processors!
   libmesh_assert_equal_to (m_in, m_l);
   libmesh_assert_equal_to (n_in, n_l);
   libmesh_assert_equal_to (m_in, n_in);
   libmesh_assert_greater (nnz, 0);
 
   if ((m_in != m_l) ||
       (n_in != n_l))
     libmesh_not_implemented_msg("Laspack does not support distributed matrices");
 
   if (m_in != n_in)
     libmesh_not_implemented_msg("Laspack does not support rectangular matrices");
 
   if (nnz < n_in)
     libmesh_warning("Using inefficient LaspackMatrix allocation via this init() method");
 
   const dof_id_type n_rows = m_in;
 
   // Laspack doesn't let us assign sparse indices on the fly, so
   // without a sparsity pattern we're stuck allocating a dense matrix
   {
     _csr.resize       (m_in * m_in);
     _row_start.reserve(m_in + 1);
   }
 
   // Initialize the _csr data structure.
   {
     std::vector<numeric_index_type>::iterator position = _csr.begin();
 
     _row_start.push_back (position);
 
     for (numeric_index_type row=0; row<n_rows; row++)
       {
         // insert the row indices
         for (const auto & col : make_range(n_rows))
           {
             libmesh_assert (position != _csr.end());
             *position = col;
             ++position;
           }
 
         _row_start.push_back (position);
       }
   }
 
   Q_Constr(&_QMat, const_cast<char *>("Mat"), m_in, _LPFalse, Rowws, Normal, _LPTrue);
 
   this->_is_initialized = true;
 
   // Tell the matrix about its structure.  Initialize it
   // to zero.
   for (numeric_index_type i=0; i<n_rows; i++)
     {
       auto rs = _row_start[i];
 
       const numeric_index_type length = _row_start[i+1] - rs;
 
       Q_SetLen (&_QMat, i+1, length);
 
       for (numeric_index_type l=0; l<length; l++)
         {
           const numeric_index_type j = *(rs+l);
 
           libmesh_assert_equal_to (this->pos(i,j), l);
           Q_SetEntry (&_QMat, i+1, l, j+1, 0.);
         }
     }
 }

◆ init() [2/2]

template<typename T >

void libMesh::LaspackMatrix< T >::init ( ParallelType type = PARALLEL )

overridevirtual

Initialize this matrix using the sparsity structure computed by dof_map.

Parameters

type	The serial/parallel/ghosted type of the matrix

Implements libMesh::SparseMatrix< T >.

Definition at line 208 of file laspack_matrix.C.

References libMesh::libMeshPrivateData::_is_initialized, libMesh::initialized(), and libMesh::libmesh_assert().

 {
   // Ignore calls on initialized objects
   if (this->initialized())
     return;
 
   // We need a sparsity pattern for this!
   libmesh_assert(this->_sp);
 
   // Clear initialized matrices
   if (this->initialized())
     this->clear();
 
   const numeric_index_type n_rows   = this->_dof_map->n_dofs();
 #ifndef NDEBUG
   // The following variables are only used for assertions,
   // so avoid declaring them when asserts are inactive.
   const numeric_index_type n_cols   = n_rows;
   const numeric_index_type n_l = this->_dof_map->n_dofs_on_processor(0);
   const numeric_index_type m_l = n_l;
 #endif
 
   // Laspack Matrices only work for uniprocessor cases
   libmesh_assert_equal_to (n_rows, n_cols);
   libmesh_assert_equal_to (m_l, n_rows);
   libmesh_assert_equal_to (n_l, n_cols);
 
 #ifndef NDEBUG
   // The following variables are only used for assertions,
   // so avoid declaring them when asserts are inactive.
   const std::vector<numeric_index_type> & n_nz = this->_sp->get_n_nz();
   const std::vector<numeric_index_type> & n_oz = this->_sp->get_n_oz();
 #endif
 
   // Make sure the sparsity pattern isn't empty
   libmesh_assert_equal_to (n_nz.size(), n_l);
   libmesh_assert_equal_to (n_oz.size(), n_l);
 
   if (n_rows==0)
     return;
 
   Q_Constr(&_QMat, const_cast<char *>("Mat"), n_rows, _LPFalse, Rowws, Normal, _LPTrue);
 
   this->_is_initialized = true;
 
   libmesh_assert_equal_to (n_rows, this->m());
 }

◆ initialized()

template<typename T>

virtual bool libMesh::SparseMatrix< T >::initialized ( ) const

inlinevirtualinherited

Returns: true if the matrix has been initialized, false otherwise.

Definition at line 109 of file sparse_matrix.h.

Referenced by libMesh::PetscMatrix< libMesh::Number >::_get_submatrix(), libMesh::ImplicitSystem::assemble(), and libMesh::System::init_matrices().

109 { return _is_initialized; }

libMesh::SparseMatrix::_is_initialized

bool _is_initialized

Flag indicating whether or not the matrix has been initialized.

Definition: sparse_matrix.h:579

◆ l1_norm()

template<typename T >

Real libMesh::LaspackMatrix< T >::l1_norm ( ) const

overridevirtual

Returns: The \( \ell_1 \)-norm of the matrix, that is the max column sum: \( |M|_1 = \max_{j} \sum_{i} |M_{ij}| \)

This is the natural matrix norm that is compatible with the \( \ell_1 \)-norm for vectors, i.e. \( |Mv|_1 \leq |M|_1 |v|_1 \). (cf. Haemmerlin-Hoffmann : Numerische Mathematik)

Implements libMesh::SparseMatrix< T >.

Definition at line 279 of file laspack_matrix.C.

References std::abs(), and libMesh::make_range().

 {
   // There does not seem to be a straightforward way to iterate over
   // the columns of a LaspackMatrix.  So we use some extra storage and
   // keep track of the column sums while going over the row entries...
   std::vector<Real> abs_col_sums(this->n());
 
   const numeric_index_type n_rows = this->m();
 
   for (numeric_index_type row : make_range(n_rows))
     {
       auto r_start = _row_start[row];
 
       const numeric_index_type len = (_row_start[row+1] - _row_start[row]);
 
       // Make sure we agree on the row length
       libmesh_assert_equal_to (len, Q_GetLen(&_QMat, row+1));
 
       for (numeric_index_type l=0; l<len; l++)
         {
           const numeric_index_type j = *(r_start + l);
 
           // Make sure the data structures are working
           libmesh_assert_equal_to ((j+1), Q_GetPos (&_QMat, row+1, l));
 
           abs_col_sums[j] += std::abs(Q_GetVal (&_QMat, row+1, l));
         }
     }
 
   return *(std::max_element(abs_col_sums.begin(), abs_col_sums.end()));
 }

◆ linfty_norm()

template<typename T>

virtual Real libMesh::LaspackMatrix< T >::linfty_norm ( ) const

inlineoverridevirtual

Returns: The \( \ell_{\infty} \)-norm of the matrix, that is the max row sum:

\( |M|_{\infty} = \max_{i} \sum_{j} |M_{ij}| \)

This is the natural matrix norm that is compatible to the \( \ell_{\infty} \)-norm of vectors, i.e. \( |Mv|_{\infty} \leq |M|_{\infty} |v|_{\infty} \). (cf. Haemmerlin-Hoffmann : Numerische Mathematik)

Implements libMesh::SparseMatrix< T >.

Definition at line 157 of file laspack_matrix.h.

157 { libmesh_not_implemented(); return 0.; }

◆ local_m()

template<typename T>

virtual numeric_index_type libMesh::SparseMatrix< T >::local_m ( ) const

inlinevirtualinherited

Get the number of rows owned by this process.

Reimplemented in libMesh::PetscMatrix< T >, and libMesh::PetscMatrix< libMesh::Number >.

Definition at line 225 of file sparse_matrix.h.

225 { return row_stop() - row_start(); }

libMesh::SparseMatrix::row_stop

virtual numeric_index_type row_stop() const =0

libMesh::SparseMatrix::row_start

virtual numeric_index_type row_start() const =0

◆ local_n()

template<typename T>

virtual numeric_index_type libMesh::SparseMatrix< T >::local_n ( ) const

inlinevirtualinherited

Get the number of columns owned by this process.

Reimplemented in libMesh::PetscMatrix< T >, and libMesh::PetscMatrix< libMesh::Number >.

Definition at line 230 of file sparse_matrix.h.

230 { return col_stop() - col_start(); }

libMesh::SparseMatrix::col_stop

virtual numeric_index_type col_stop() const =0

libMesh::SparseMatrix::col_start

virtual numeric_index_type col_start() const =0

◆ m()

template<typename T >

numeric_index_type libMesh::LaspackMatrix< T >::m ( ) const

overridevirtual

Returns: The row-dimension of the matrix.

Implements libMesh::SparseMatrix< T >.

Definition at line 454 of file laspack_matrix.C.

References libMesh::initialized(), and libMesh::libmesh_assert().

 {
   libmesh_assert (this->initialized());
 
   return static_cast<numeric_index_type>(Q_GetDim(const_cast<QMatrix*>(&_QMat)));
 }

◆ matrix_matrix_mult()

template<typename T>

virtual void libMesh::SparseMatrix< T >::matrix_matrix_mult	(	SparseMatrix< T > &	,
		SparseMatrix< T > &	,
		bool
	)

inlinevirtualinherited

Compute Y = A*X for matrix X.

Reimplemented in libMesh::PetscMatrix< T >.

Definition at line 320 of file sparse_matrix.h.

321 { libmesh_not_implemented(); }

◆ n()

template<typename T >

numeric_index_type libMesh::LaspackMatrix< T >::n ( ) const

overridevirtual

Returns: The column-dimension of the matrix.

Implements libMesh::SparseMatrix< T >.

Definition at line 464 of file laspack_matrix.C.

References libMesh::initialized(), and libMesh::libmesh_assert().

 {
   libmesh_assert (this->initialized());
 
   return static_cast<numeric_index_type>(Q_GetDim(const_cast<QMatrix*>(&_QMat)));
 }

◆ n_nonzeros()

template<typename T >

std::size_t libMesh::SparseMatrix< T >::n_nonzeros ( ) const

virtualinherited

Returns: the global number of non-zero entries in the matrix sparsity pattern

Definition at line 229 of file sparse_matrix.C.

Referenced by libMesh::SparseMatrix< ValOut >::n_nonzeros().

 {
   if (!_sp)
     return 0;
   return _sp->n_nonzeros();
 }

◆ n_objects()

static unsigned int libMesh::ReferenceCounter::n_objects ( )

inlinestaticinherited

Prints the number of outstanding (created, but not yet destroyed) objects.

Definition at line 85 of file reference_counter.h.

References libMesh::ReferenceCounter::_n_objects.

Referenced by libMesh::LibMeshInit::~LibMeshInit().

86 { return _n_objects; }

libMesh::ReferenceCounter::_n_objects

static Threads::atomic< unsigned int > _n_objects

The number of objects.

Definition: reference_counter.h:132

◆ n_processors()

processor_id_type libMesh::ParallelObject::n_processors ( ) const

inlineinherited

Returns: The number of processors in the group.

Definition at line 103 of file parallel_object.h.

References libMesh::ParallelObject::_communicator, libMesh::libmesh_assert(), and TIMPI::Communicator::size().

   {
     processor_id_type returnval =
       cast_int<processor_id_type>(_communicator.size());
     libmesh_assert(returnval); // We never have an empty comm
     return returnval;
   }

◆ need_full_sparsity_pattern()

template<typename T>

virtual bool libMesh::LaspackMatrix< T >::need_full_sparsity_pattern ( ) const

inlineoverridevirtual

The LaspackMatrix needs the full sparsity pattern.

Reimplemented from libMesh::SparseMatrix< T >.

Definition at line 86 of file laspack_matrix.h.

87 { return true; }

◆ operator()()

template<typename T >

T libMesh::LaspackMatrix< T >::operator()	(	const numeric_index_type	i,
		const numeric_index_type	j
	)		const

overridevirtual

Returns: A copy of matrix entry (i,j).

Note: This may be an expensive operation, and you should always be careful where you call this function.

Implements libMesh::SparseMatrix< T >.

Definition at line 600 of file laspack_matrix.C.

References libMesh::initialized(), and libMesh::libmesh_assert().

 {
   libmesh_assert (this->initialized());
   libmesh_assert_less (i, this->m());
   libmesh_assert_less (j, this->n());
 
   return Q_GetEl (const_cast<QMatrix*>(&_QMat), i+1, j+1);
 }

◆ operator=() [1/2]

template<typename T>

LaspackMatrix& libMesh::LaspackMatrix< T >::operator= ( const LaspackMatrix< T > & )

delete

◆ operator=() [2/2]

template<typename T>

LaspackMatrix& libMesh::LaspackMatrix< T >::operator= ( LaspackMatrix< T > && )

delete

◆ pos()

template<typename T >

numeric_index_type libMesh::LaspackMatrix< T >::pos	(	const numeric_index_type	i,
		const numeric_index_type	j
	)		const

private

Returns: The position in the compressed row storage scheme of the \( (i,j) \) element.

Definition at line 613 of file laspack_matrix.C.

References distance(), and libMesh::libmesh_assert().

 {
   libmesh_assert_less (i, this->m());
   libmesh_assert_less (j, this->n());
   libmesh_assert_less (i+1, _row_start.size());
   libmesh_assert (_row_start.back() == _csr.end());
 
   // note this requires the _csr to be sorted
   auto p = std::equal_range (_row_start[i], _row_start[i+1], j);
 
   // Make sure the row contains the element j
   libmesh_assert (p.first != p.second);
 
   // Make sure the values match
   libmesh_assert (*p.first == j);
 
   // Return the position in the compressed row
   return std::distance (_row_start[i], p.first);
 }

◆ print() [1/2]

template<>

void libMesh::SparseMatrix< Complex >::print	(	std::ostream &	os,
		const bool	sparse
	)		const

inherited

Definition at line 122 of file sparse_matrix.C.

 {
   // std::complex<>::operator<<() is defined, but use this form
 
   if (sparse)
     {
       libmesh_not_implemented();
     }
 
   os << "Real part:" << std::endl;
   for (auto i : make_range(this->m()))
     {
       for (auto j : make_range(this->n()))
         os << std::setw(8) << (*this)(i,j).real() << " ";
       os << std::endl;
     }
 
   os << std::endl << "Imaginary part:" << std::endl;
   for (auto i : make_range(this->m()))
     {
       for (auto j : make_range(this->n()))
         os << std::setw(8) << (*this)(i,j).imag() << " ";
       os << std::endl;
     }
 }

◆ print() [2/2]

template<typename T >

void libMesh::SparseMatrix< T >::print	(	std::ostream &	os = `libMesh::out`,
		const bool	sparse = `false`
	)		const

inherited

Print the contents of the matrix to the screen in a uniform style, regardless of matrix/solver package being used.

Definition at line 238 of file sparse_matrix.C.

Referenced by libMesh::EigenSparseMatrix< T >::print_personal(), and libMesh::LaspackMatrix< T >::print_personal().

 {
   parallel_object_only();
 
   libmesh_assert (this->initialized());
 
   const numeric_index_type first_dof = this->row_start(),
                            end_dof   = this->row_stop();
 
   // We'll print the matrix from processor 0 to make sure
   // it's serialized properly
   if (this->processor_id() == 0)
     {
       libmesh_assert_equal_to (first_dof, 0);
       for (numeric_index_type i : make_range(end_dof))
         {
           if (sparse)
             {
               for (auto j : make_range(this->n()))
                 {
                   T c = (*this)(i,j);
                   if (c != static_cast<T>(0.0))
                     {
                       os << i << " " << j << " " << c << std::endl;
                     }
                 }
             }
           else
             {
               for (auto j : make_range(this->n()))
                 os << (*this)(i,j) << " ";
               os << std::endl;
             }
         }
 
       std::vector<numeric_index_type> ibuf, jbuf;
       std::vector<T> cbuf;
       numeric_index_type currenti = end_dof;
       for (auto p : IntRange<processor_id_type>(1, this->n_processors()))
         {
           this->comm().receive(p, ibuf);
           this->comm().receive(p, jbuf);
           this->comm().receive(p, cbuf);
           libmesh_assert_equal_to (ibuf.size(), jbuf.size());
           libmesh_assert_equal_to (ibuf.size(), cbuf.size());
 
           if (ibuf.empty())
             continue;
           libmesh_assert_greater_equal (ibuf.front(), currenti);
           libmesh_assert_greater_equal (ibuf.back(), ibuf.front());
 
           std::size_t currentb = 0;
           for (;currenti <= ibuf.back(); ++currenti)
             {
               if (sparse)
                 {
                   for (numeric_index_type j=0; j<this->n(); j++)
                     {
                       if (currentb < ibuf.size() &&
                           ibuf[currentb] == currenti &&
                           jbuf[currentb] == j)
                         {
                           os << currenti << " " << j << " " << cbuf[currentb] << std::endl;
                           currentb++;
                         }
                     }
                 }
               else
                 {
                   for (auto j : make_range(this->n()))
                     {
                       if (currentb < ibuf.size() &&
                           ibuf[currentb] == currenti &&
                           jbuf[currentb] == j)
                         {
                           os << cbuf[currentb] << " ";
                           currentb++;
                         }
                       else
                         os << static_cast<T>(0.0) << " ";
                     }
                   os << std::endl;
                 }
             }
         }
       if (!sparse)
         {
           for (; currenti != this->m(); ++currenti)
             {
               for (numeric_index_type j=0; j<this->n(); j++)
                 os << static_cast<T>(0.0) << " ";
               os << std::endl;
             }
         }
     }
   else
     {
       std::vector<numeric_index_type> ibuf, jbuf;
       std::vector<T> cbuf;
 
       // We'll assume each processor has access to entire
       // matrix rows, so (*this)(i,j) is valid if i is a local index.
       for (numeric_index_type i : make_range(first_dof, end_dof))
         {
           for (auto j : make_range(this->n()))
             {
               T c = (*this)(i,j);
               if (c != static_cast<T>(0.0))
                 {
                   ibuf.push_back(i);
                   jbuf.push_back(j);
                   cbuf.push_back(c);
                 }
             }
         }
       this->comm().send(0,ibuf);
       this->comm().send(0,jbuf);
       this->comm().send(0,cbuf);
     }
 }

◆ print_info()

void libMesh::ReferenceCounter::print_info ( std::ostream & out_stream = libMesh::out )

staticinherited

Prints the reference information, by default to libMesh::out.

Definition at line 81 of file reference_counter.C.

References libMesh::ReferenceCounter::_enable_print_counter, and libMesh::ReferenceCounter::get_info().

Referenced by libMesh::LibMeshInit::~LibMeshInit().

 {
   if (_enable_print_counter)
     out_stream << ReferenceCounter::get_info();
 }

◆ print_matlab()

template<typename T >

void libMesh::SparseMatrix< T >::print_matlab ( const std::string & name = "" ) const

virtualinherited

Print the contents of the matrix in Matlab's sparse matrix format.

Optionally prints the matrix to the file named name. If name is not specified it is dumped to the screen.

Reimplemented in libMesh::PetscMatrix< T >, and libMesh::PetscMatrix< libMesh::Number >.

Definition at line 361 of file sparse_matrix.C.

 {
   parallel_object_only();
 
   libmesh_assert (this->initialized());
 
   const numeric_index_type first_dof = this->row_start(),
                            end_dof   = this->row_stop();
 
   // We'll print the matrix from processor 0 to make sure
   // it's serialized properly
   if (this->processor_id() == 0)
     {
       std::unique_ptr<std::ofstream> file;
 
       if (name != "")
         file = std::make_unique<std::ofstream>(name.c_str());
 
       std::ostream & os = (name == "") ? libMesh::out : *file;
 
       std::size_t sparsity_nonzeros = this->n_nonzeros();
 
       std::size_t real_nonzeros = 0;
 
       libmesh_assert_equal_to(first_dof, 0);
       for (numeric_index_type i : make_range(end_dof))
         {
           for (auto j : make_range(this->n()))
             {
               T c = (*this)(i,j);
               if (c != static_cast<T>(0.0))
                 ++real_nonzeros;
             }
         }
 
 
       for (auto p : IntRange<processor_id_type>(1, this->n_processors()))
         {
           std::size_t nonzeros_on_p = 0;
           this->comm().receive(p, nonzeros_on_p);
           real_nonzeros += nonzeros_on_p;
         }
 
       if (sparsity_nonzeros &&
           sparsity_nonzeros != real_nonzeros)
         libmesh_warning(sparsity_nonzeros <<
                         " nonzeros allocated, but " <<
                         real_nonzeros << " used.");
 
       // We probably want to be more consistent than that, if our
       // sparsity is overallocated.
 
       // Print a header similar to PETSc's mat_view ascii_matlab
       os << "%Mat Object: () " << this->n_processors() << " MPI processes\n"
          << "%  type: " << (this->n_processors() > 1 ? "mpi" : "seq") << "aij\n"
          << "% Size = " << this->m() << ' ' << this->n() << '\n'
          << "% Nonzeros = " << real_nonzeros << '\n'
          << "zzz = zeros(" << real_nonzeros << ",3);\n"
          << "zzz = [\n";
 
       for (numeric_index_type i : make_range(end_dof))
         {
           // FIXME - we need a base class way to iterate over a
           // SparseMatrix row.
           for (auto j : make_range(this->n()))
             {
               T c = (*this)(i,j);
               if (c != static_cast<T>(0.0))
                 {
                   // Convert from 0-based to 1-based indexing
                   os << (i+1) << ' ' << (j+1) << "  " << c << '\n';
                 }
             }
         }
 
       std::vector<numeric_index_type> ibuf, jbuf;
       std::vector<T> cbuf;
       for (auto p : IntRange<processor_id_type>(1, this->n_processors()))
         {
           this->comm().receive(p, ibuf);
           this->comm().receive(p, jbuf);
           this->comm().receive(p, cbuf);
           libmesh_assert_equal_to (ibuf.size(), jbuf.size());
           libmesh_assert_equal_to (ibuf.size(), cbuf.size());
 
           for (auto n : index_range(ibuf))
             os << ibuf[n] << ' ' << jbuf[n] << "  " << cbuf[n] << '\n';
         }
 
       os << "];\n" << "Mat_sparse = spconvert(zzz);" << std::endl;
     }
   else
     {
       std::vector<numeric_index_type> ibuf, jbuf;
       std::vector<T> cbuf;
       std::size_t my_nonzeros = 0;
 
       // We'll assume each processor has access to entire
       // matrix rows, so (*this)(i,j) is valid if i is a local index.
       for (numeric_index_type i : make_range(first_dof, end_dof))
         {
           for (auto j : make_range(this->n()))
             {
               T c = (*this)(i,j);
               if (c != static_cast<T>(0.0))
                 {
                   ibuf.push_back(i);
                   jbuf.push_back(j);
                   cbuf.push_back(c);
                   ++my_nonzeros;
                 }
             }
         }
       this->comm().send(0,my_nonzeros);
       this->comm().send(0,ibuf);
       this->comm().send(0,jbuf);
       this->comm().send(0,cbuf);
     }
 }

◆ print_personal()

template<typename T>

virtual void libMesh::LaspackMatrix< T >::print_personal ( std::ostream & os = libMesh::out ) const

inlineoverridevirtual

Print the contents of the matrix to the screen in a package-personalized style, if available.

Implements libMesh::SparseMatrix< T >.

Definition at line 161 of file laspack_matrix.h.

References libMesh::SparseMatrix< T >::print().

161 { this->print(os); }

libMesh::SparseMatrix::print

void print(std::ostream &os=libMesh::out, const bool sparse=false) const

Print the contents of the matrix to the screen in a uniform style, regardless of matrix/solver packag...

Definition: sparse_matrix.C:238

◆ print_petsc_binary()

template<typename T >

void libMesh::SparseMatrix< T >::print_petsc_binary ( const std::string & filename )

virtualinherited

Write the contents of the matrix to a file in PETSc's binary sparse matrix format.

Reimplemented in libMesh::PetscMatrix< T >, and libMesh::PetscMatrix< libMesh::Number >.

Definition at line 484 of file sparse_matrix.C.

 {
   libmesh_not_implemented_msg
     ("libMesh cannot write PETSc binary-format files from non-PETSc matrices");
 }

◆ print_petsc_hdf5()

template<typename T >

void libMesh::SparseMatrix< T >::print_petsc_hdf5 ( const std::string & filename )

virtualinherited

Write the contents of the matrix to a file in PETSc's HDF5 sparse matrix format.

Reimplemented in libMesh::PetscMatrix< T >, and libMesh::PetscMatrix< libMesh::Number >.

Definition at line 493 of file sparse_matrix.C.

 {
   libmesh_not_implemented_msg
     ("libMesh cannot write PETSc HDF5-format files from non-PETSc matrices");
 }

◆ processor_id()

processor_id_type libMesh::ParallelObject::processor_id ( ) const

inlineinherited

Returns: The rank of this processor in the group.

Definition at line 114 of file parallel_object.h.

References libMesh::ParallelObject::_communicator, and TIMPI::Communicator::rank().

115 { return cast_int<processor_id_type>(_communicator.rank()); }

TIMPI::Communicator::rank

processor_id_type rank() const

libMesh::ParallelObject::_communicator

const Parallel::Communicator & _communicator

Definition: parallel_object.h:120

◆ read_matlab()

template<typename T >

void libMesh::SparseMatrix< T >::read_matlab ( const std::string & filename )

virtualinherited

Read the contents of the matrix from Matlab's sparse matrix format.

If the size and sparsity of the matrix in filename appears consistent with the existing sparsity of this then the existing parallel decomposition and sparsity will be retained. If not, then this will be initialized with the sparsity from the file, linearly partitioned onto the number of processors available.

Definition at line 502 of file sparse_matrix.C.

Referenced by ConstraintOperatorTest::test1DCoarseningNewNodes(), and ConstraintOperatorTest::testCoreform().

 {
 #ifndef LIBMESH_HAVE_CXX11_REGEX
   libmesh_not_implemented();  // What is your compiler?!?  Email us!
   libmesh_ignore(filename);
 #else
   parallel_object_only();
 
   // The sizes we get from the file
   std::size_t m = 0,
               n = 0;
 
   // We'll read through the file three times: once to get a reliable
   // value for the matrix size (so we can divvy it up among
   // processors), then again to get the sparsity to send to each
   // processor, then a final time to get the entries to send to each
   // processor.
   std::unique_ptr<std::ifstream> file;
 
   // We'll be using regular expressions to make ourselves slightly
   // more robust to formatting.
   const std::regex start_regex // assignment like "zzz = ["
     ("\\s*\\w+\\s*=\\s*\\[");
   const std::regex entry_regex // row/col/val like "1 1 -2.0e-4"
     ("(\\d+)\\s+(\\d+)\\s+([+-]?(\\d+([.]\\d*)?([eE][+-]?\\d+)?|[.]\\d+([eE][+-]?\\d+)?))");
   const std::regex end_regex // end of assignment
     ("^[^%]*\\]");
 
   // We'll read the matrix on processor 0 rather than try to juggle
   // parallel I/O.  Start by reading to deduce the size.
   if (this->processor_id() == 0)
     {
       file = std::make_unique<std::ifstream>(filename.c_str());
 
       // If we have a matrix with all-zero trailing rows, the only
       // way to get the size is if it ended up in a comment
       const std::regex size_regex // comment like "% size = 8 8"
         ("%\\s*[Ss][Ii][Zz][Ee]\\s*=\\s*(\\d+)\\s+(\\d+)");
 
       // Get the size
       bool have_started = false;
       bool have_ended = false;
       std::size_t largest_i_seen = 0, largest_j_seen = 0;
       for (std::string line; std::getline(*file, line);)
         {
           std::smatch sm;
 
           if (std::regex_search(line, sm, size_regex))
             {
               const std::string msize = sm[1];
               const std::string nsize = sm[2];
               m = std::stoull(msize);
               n = std::stoull(nsize);
             }
 
           if (std::regex_search(line, start_regex))
             have_started = true;
 
           if (std::regex_search(line, sm, entry_regex))
             {
               libmesh_error_msg_if
                 (!have_started, "Confused by premature entries in matrix file " << filename);
 
               const std::string istr = sm[1];
               const std::string jstr = sm[2];
 
               std::size_t i = std::stoull(istr);
               largest_i_seen = std::max(i, largest_i_seen);
               std::size_t j = std::stoull(jstr);
               largest_j_seen = std::max(j, largest_j_seen);
             }
 
           if (std::regex_search(line, end_regex))
             {
               have_ended = true;
               break;
             }
         }
 
       libmesh_error_msg_if
         (!have_started, "Confused by missing assignment beginning in matrix file " << filename);
 
       libmesh_error_msg_if
         (!have_ended, "Confused by missing assignment ending in matrix file " << filename);
 
       libmesh_error_msg_if
         (m > largest_i_seen, "Confused by missing final row(s) in matrix file " << filename);
 
       libmesh_error_msg_if
         (m > 0 && m < largest_i_seen, "Confused by extra final row(s) in matrix file " << filename);
 
       if (!m)
         m = largest_i_seen;
 
       libmesh_error_msg_if
         (n > largest_j_seen, "Confused by missing final column(s) in matrix file " << filename);
 
       libmesh_error_msg_if
         (n > 0 && n < largest_j_seen, "Confused by extra final column(s) in matrix file " << filename);
 
       if (!n)
         n = largest_j_seen;
 
       this->comm().broadcast(m);
       this->comm().broadcast(n);
     }
   else
     {
       this->comm().broadcast(m);
       this->comm().broadcast(n);
     }
 
   // If we don't already have this size, we'll need to reinit later,
   // and we'll need to redetermine which rows each processor is in
   // charge of.
 
   numeric_index_type
     new_row_start =     this->processor_id() * m / this->n_processors(),
     new_row_stop  = (this->processor_id()+1) * m / this->n_processors();
   numeric_index_type
     new_col_start =     this->processor_id() * n / this->n_processors(),
     new_col_stop  = (this->processor_id()+1) * n / this->n_processors();
 
   if (this->initialized() &&
       m == this->m() &&
       n == this->n())
     {
       new_row_start = this->row_start(),
       new_row_stop  = this->row_stop();
 
       new_col_start = this->col_start(),
       new_col_stop  = this->col_stop();
     }
 
   std::vector<numeric_index_type> new_row_starts, new_row_stops,
                                   new_col_starts, new_col_stops;
 
   this->comm().gather(0, new_row_start, new_row_starts);
   this->comm().gather(0, new_row_stop, new_row_stops);
   this->comm().gather(0, new_col_start, new_col_starts);
   this->comm().gather(0, new_col_stop, new_col_stops);
 
   // Reread to deduce the sparsity pattern, or at least the maximum
   // number of on- and off- diagonal non-zeros per row.
   numeric_index_type  on_diagonal_nonzeros =0,
                      off_diagonal_nonzeros =0;
 
   if (this->processor_id() == 0)
     {
       file->seekg(0);
 
       bool have_started = false;
 
       // Data for the row we're working on
 
       // Use 1-based indexing for current_row, as in the file
       numeric_index_type current_row = 1;
       processor_id_type current_proc = 0;
       numeric_index_type current_on_diagonal_nonzeros = 0;
       numeric_index_type current_off_diagonal_nonzeros = 0;
 
       for (std::string line; std::getline(*file, line);)
         {
           std::smatch sm;
 
           if (std::regex_search(line, start_regex))
             have_started = true;
 
           if (have_started && std::regex_search(line, sm, entry_regex))
             {
               const std::string istr = sm[1];
               const std::string jstr = sm[2];
 
               const numeric_index_type i = std::stoull(istr);
               const numeric_index_type j = std::stoull(jstr);
 
               libmesh_error_msg_if
                 (!i || !j, "Expected 1-based indexing in matrix file "
                  << filename);
 
               libmesh_error_msg_if
                 (i < current_row,
                  "Can't handle out-of-order entries in matrix file "
                  << filename);
               if (i > current_row)
                 {
                   current_row = i;
                   // +1 for 1-based indexing in file
                   while (current_row >= (new_row_stops[current_proc]+1))
                     ++current_proc;
                   current_on_diagonal_nonzeros = 0;
                   current_off_diagonal_nonzeros = 0;
                 }
 
               // +1 for 1-based indexing in file
               if (j >= (new_col_starts[current_proc]+1) &&
                   j < (new_col_stops[current_proc]+1))
                 {
                   ++current_on_diagonal_nonzeros;
                   on_diagonal_nonzeros =
                     std::max(on_diagonal_nonzeros,
                              current_on_diagonal_nonzeros);
                 }
               else
                 {
                   ++current_off_diagonal_nonzeros;
                   off_diagonal_nonzeros =
                     std::max(off_diagonal_nonzeros,
                              current_off_diagonal_nonzeros);
                 }
             }
 
           if (std::regex_search(line, end_regex))
             break;
         }
     }
 
   this->comm().broadcast(on_diagonal_nonzeros);
   this->comm().broadcast(off_diagonal_nonzeros);
 
   this->init(m, n,
              new_row_stop-new_row_start,
              new_col_stop-new_col_start,
              on_diagonal_nonzeros,
              off_diagonal_nonzeros);
 
   // One last reread to set values
   if (this->processor_id() == 0)
     {
       file->seekg(0);
 
       bool have_started = false;
 
       for (std::string line; std::getline(*file, line);)
         {
           std::smatch sm;
 
           if (std::regex_search(line, start_regex))
             have_started = true;
 
           if (have_started && std::regex_search(line, sm, entry_regex))
             {
               const std::string istr = sm[1];
               const std::string jstr = sm[2];
               const std::string cstr = sm[3];
 
               const numeric_index_type i = std::stoull(istr);
               const numeric_index_type j = std::stoull(jstr);
 
               // Try to be compatible with
               // higher-than-double-precision T
               std::stringstream ss(cstr);
               T value;
               ss >> value;
 
               // Convert from 1-based to 0-based indexing
               this->set(i-1, j-1, value);
             }
 
           if (std::regex_search(line, end_regex))
             break;
         }
     }
   this->close();
 #endif
 }

◆ read_petsc_binary()

template<typename T >

void libMesh::SparseMatrix< T >::read_petsc_binary ( const std::string & filename )

virtualinherited

Read the contents of the matrix from a file in PETSc's binary sparse matrix format.

Reimplemented in libMesh::PetscMatrix< T >, and libMesh::PetscMatrix< libMesh::Number >.

Definition at line 772 of file sparse_matrix.C.

 {
   libmesh_not_implemented_msg
     ("libMesh cannot read PETSc binary-format files into non-PETSc matrices");
 }

◆ read_petsc_hdf5()

template<typename T >

void libMesh::SparseMatrix< T >::read_petsc_hdf5 ( const std::string & filename )

virtualinherited

Read the contents of the matrix from a file in PETSc's HDF5 sparse matrix format.

Reimplemented in libMesh::PetscMatrix< T >, and libMesh::PetscMatrix< libMesh::Number >.

Definition at line 781 of file sparse_matrix.C.

 {
   libmesh_not_implemented_msg
     ("libMesh cannot read PETSc HDF5-format files into non-PETSc matrices");
 }

◆ reinit_submatrix()

template<typename T>

virtual void libMesh::SparseMatrix< T >::reinit_submatrix	(	SparseMatrix< T > &	submatrix,
		const std::vector< numeric_index_type > &	rows,
		const std::vector< numeric_index_type > &	cols
	)		const

inlinevirtualinherited

This function is similar to the one above, but it allows you to reuse the existing sparsity pattern of "submatrix" instead of reallocating it again.

This should hopefully be more efficient if you are frequently extracting submatrices of the same size.

Definition at line 500 of file sparse_matrix.h.

   {
     this->_get_submatrix(submatrix,
                          rows,
                          cols,
                          true); // true means REUSE submatrix
   }

◆ row_start()

template<typename T >

numeric_index_type libMesh::LaspackMatrix< T >::row_start ( ) const

overridevirtual

Returns: The index of the first matrix row stored on this processor.

Implements libMesh::SparseMatrix< T >.

Definition at line 474 of file laspack_matrix.C.

 {
   return 0;
 }

◆ row_stop()

template<typename T >

numeric_index_type libMesh::LaspackMatrix< T >::row_stop ( ) const

overridevirtual

Returns: The index of the last matrix row (+1) stored on this processor.

Implements libMesh::SparseMatrix< T >.

Definition at line 482 of file laspack_matrix.C.

 {
   return this->m();
 }

◆ set()

template<typename T >

void libMesh::LaspackMatrix< T >::set	(	const numeric_index_type	i,
		const numeric_index_type	j,
		const T	value
	)

overridevirtual

Set the element (i,j) to value.

Throws an error if the entry does not exist. Zero values can be "stored" in non-existent fields.

Implements libMesh::SparseMatrix< T >.

Definition at line 506 of file laspack_matrix.C.

References libMesh::initialized(), libMesh::libmesh_assert(), and value.

 {
   libmesh_assert (this->initialized());
   libmesh_assert_less (i, this->m());
   libmesh_assert_less (j, this->n());
 
   const numeric_index_type position = this->pos(i,j);
 
   // Sanity check
   libmesh_assert_equal_to (*(_row_start[i]+position), j);
   libmesh_assert_equal_to ((j+1), Q_GetPos (&_QMat, i+1, position));
 
   Q_SetEntry (&_QMat, i+1, position, j+1, value);
 }

◆ update_sparsity_pattern()

template<typename T >

void libMesh::LaspackMatrix< T >::update_sparsity_pattern ( const SparsityPattern::Graph & sparsity_pattern )

overridevirtual

Updates the matrix sparsity pattern.

This will tell the underlying matrix storage scheme how to map the \( (i,j) \) elements.

Reimplemented from libMesh::SparseMatrix< T >.

Definition at line 42 of file laspack_matrix.C.

References libMesh::TriangleWrapper::init(), libMesh::initialized(), and libMesh::libmesh_assert().

 {
   // clear data, start over
   this->clear ();
 
   // big trouble if this fails!
   libmesh_assert(this->_dof_map);
 
   const numeric_index_type n_rows = sparsity_pattern.size();
 
   // Initialize the _row_start data structure,
   // allocate storage for the _csr array
   {
     std::size_t size = 0;
 
     for (numeric_index_type row=0; row<n_rows; row++)
       size += sparsity_pattern[row].size();
 
     _csr.resize       (size);
     _row_start.reserve(n_rows + 1);
   }
 
 
   // Initialize the _csr data structure.
   {
     std::vector<numeric_index_type>::iterator position = _csr.begin();
 
     _row_start.push_back (position);
 
     for (numeric_index_type row=0; row<n_rows; row++)
       {
         // insert the row indices
         for (const auto & col : sparsity_pattern[row])
           {
             libmesh_assert (position != _csr.end());
             *position = col;
             ++position;
           }
 
         _row_start.push_back (position);
       }
   }
 
 
   // Initialize the matrix
   libmesh_assert (!this->initialized());
   this->init ();
   libmesh_assert (this->initialized());
   //libMesh::out << "n_rows=" << n_rows << std::endl;
   //libMesh::out << "m()=" << m() << std::endl;
   libmesh_assert_equal_to (n_rows, this->m());
 
   // Tell the matrix about its structure.  Initialize it
   // to zero.
   for (numeric_index_type i=0; i<n_rows; i++)
     {
       auto rs = _row_start[i];
 
       const numeric_index_type length = _row_start[i+1] - rs;
 
       Q_SetLen (&_QMat, i+1, length);
 
       for (numeric_index_type l=0; l<length; l++)
         {
           const numeric_index_type j = *(rs+l);
 
           // sanity check
           //libMesh::out << "m()=" << m() << std::endl;
           //libMesh::out << "(i,j,l) = (" << i
           //          << "," << j
           //          << "," << l
           //           << ")" << std::endl;
           //libMesh::out << "pos(i,j)=" << pos(i,j)
           //              << std::endl;
           libmesh_assert_equal_to (this->pos(i,j), l);
           Q_SetEntry (&_QMat, i+1, l, j+1, 0.);
         }
     }
 
   // That's it!
   //libmesh_here();
 }

◆ vector_mult()

template<typename T>

void libMesh::SparseMatrix< T >::vector_mult	(	NumericVector< T > &	dest,
		const NumericVector< T > &	arg
	)		const

inherited

Multiplies the matrix by the NumericVector arg and stores the result in NumericVector dest.

Definition at line 200 of file sparse_matrix.C.

 {
   dest.zero();
   this->vector_mult_add(dest,arg);
 }

◆ vector_mult_add()

template<typename T>

void libMesh::SparseMatrix< T >::vector_mult_add	(	NumericVector< T > &	dest,
		const NumericVector< T > &	arg
	)		const

inherited

Multiplies the matrix by the NumericVector arg and adds the result to the NumericVector dest.

Definition at line 210 of file sparse_matrix.C.

Referenced by libMesh::ImplicitSystem::weighted_sensitivity_adjoint_solve().

 {
   /* This functionality is actually implemented in the \p
      NumericVector class.  */
   dest.add_vector(arg,*this);
 }

◆ zero()

template<typename T >

void libMesh::LaspackMatrix< T >::zero ( )

overridevirtual

Set all entries to 0.

Implements libMesh::SparseMatrix< T >.

Definition at line 393 of file laspack_matrix.C.

 {
   const numeric_index_type n_rows = this->m();
 
   for (numeric_index_type row=0; row<n_rows; row++)
     {
       auto r_start = _row_start[row];
 
       const numeric_index_type len = (_row_start[row+1] - _row_start[row]);
 
       // Make sure we agree on the row length
       libmesh_assert_equal_to (len, Q_GetLen(&_QMat, row+1));
 
       for (numeric_index_type l=0; l<len; l++)
         {
           const numeric_index_type j = *(r_start + l);
 
           // Make sure the data structures are working
           libmesh_assert_equal_to ((j+1), Q_GetPos (&_QMat, row+1, l));
 
           Q_SetEntry (&_QMat, row+1, l, j+1, 0.);
         }
     }
 
   this->close();
 }

◆ zero_clone()

template<typename T >

std::unique_ptr< SparseMatrix< T > > libMesh::LaspackMatrix< T >::zero_clone ( ) const

overridevirtual

Returns: A smart pointer to a copy of this matrix with the same type, size, and partitioning, but with all zero entries.

Note: This must be overridden in the derived classes.

Implements libMesh::SparseMatrix< T >.

Definition at line 423 of file laspack_matrix.C.

 {
   // Make empty copy with matching comm, initialize, zero, and return.
   auto mat_copy = std::make_unique<LaspackMatrix<T>>(this->comm());
   if (this->_dof_map)
     mat_copy->attach_dof_map(*this->_dof_map);
   else
     mat_copy->init(this->m(), this->n(), this->local_m(),
                    this->local_n(), this->local_n());
 
   mat_copy->zero();
 
   return mat_copy;
 }

◆ zero_rows()

template<typename T>

void libMesh::SparseMatrix< T >::zero_rows	(	std::vector< numeric_index_type > &	rows,
		T	diag_value = `0.0`
	)

virtualinherited

Sets all row entries to 0 then puts diag_value in the diagonal entry.

Reimplemented in libMesh::PetscMatrix< T >, and libMesh::DiagonalMatrix< T >.

Definition at line 221 of file sparse_matrix.C.

 {
   /* This functionality isn't implemented or stubbed in every subclass yet */
   libmesh_not_implemented();
 }

Friends And Related Function Documentation

◆ LaspackLinearSolver< T >

template<typename T>

friend class LaspackLinearSolver< T >

friend

Definition at line 205 of file laspack_matrix.h.

◆ LaspackVector< T >

template<typename T>

friend class LaspackVector< T >

friend

Make other Laspack datatypes friends.

Definition at line 204 of file laspack_matrix.h.

Member Data Documentation

◆ _closed

template<typename T>

bool libMesh::LaspackMatrix< T >::_closed

private

Flag indicating if the matrix has been closed yet.

Definition at line 199 of file laspack_matrix.h.

Referenced by libMesh::LaspackMatrix< T >::closed().

◆ _communicator

const Parallel::Communicator& libMesh::ParallelObject::_communicator

protectedinherited

Definition at line 120 of file parallel_object.h.

Referenced by libMesh::EquationSystems::build_parallel_elemental_solution_vector(), libMesh::EquationSystems::build_parallel_solution_vector(), libMesh::ParallelObject::comm(), libMesh::ParallelObject::n_processors(), libMesh::ParallelObject::operator=(), libMesh::ParallelObject::processor_id(), and libMesh::BoundaryInfo::regenerate_id_sets().

◆ _counts

ReferenceCounter::Counts libMesh::ReferenceCounter::_counts

staticprotectedinherited

Actually holds the data.

Definition at line 124 of file reference_counter.h.

Referenced by libMesh::ReferenceCounter::get_info().

◆ _csr

template<typename T>

std::vector<numeric_index_type> libMesh::LaspackMatrix< T >::_csr

private

The compressed row indices.

Definition at line 188 of file laspack_matrix.h.

◆ _dof_map

template<typename T>

DofMap const* libMesh::SparseMatrix< T >::_dof_map

protectedinherited

The DofMap object associated with this object.

May be queried for degree-of-freedom counts on processors.

Definition at line 567 of file sparse_matrix.h.

◆ _enable_print_counter

bool libMesh::ReferenceCounter::_enable_print_counter = true

staticprotectedinherited

Flag to control whether reference count information is printed when print_info is called.

Definition at line 143 of file reference_counter.h.

Referenced by libMesh::ReferenceCounter::disable_print_counter_info(), libMesh::ReferenceCounter::enable_print_counter_info(), and libMesh::ReferenceCounter::print_info().

◆ _is_initialized

template<typename T>

bool libMesh::SparseMatrix< T >::_is_initialized

protectedinherited

Flag indicating whether or not the matrix has been initialized.

Definition at line 579 of file sparse_matrix.h.

Referenced by libMesh::PetscMatrix< libMesh::Number >::_get_submatrix(), libMesh::PetscMatrix< libMesh::Number >::create_submatrix_nosort(), libMesh::EpetraMatrix< T >::EpetraMatrix(), libMesh::PetscMatrix< libMesh::Number >::get_transpose(), and libMesh::SparseMatrix< ValOut >::initialized().

◆ _mutex

Threads::spin_mutex libMesh::ReferenceCounter::_mutex

staticprotectedinherited

Mutual exclusion object to enable thread-safe reference counting.

Definition at line 137 of file reference_counter.h.

◆ _n_objects

Threads::atomic< unsigned int > libMesh::ReferenceCounter::_n_objects

staticprotectedinherited

The number of objects.

Print the reference count information when the number returns to 0.

Definition at line 132 of file reference_counter.h.

Referenced by libMesh::ReferenceCounter::n_objects(), libMesh::ReferenceCounter::ReferenceCounter(), and libMesh::ReferenceCounter::~ReferenceCounter().

◆ _QMat

template<typename T>

QMatrix libMesh::LaspackMatrix< T >::_QMat

private

The Laspack sparse matrix pointer.

Definition at line 183 of file laspack_matrix.h.

Referenced by libMesh::LaspackLinearSolver< T >::adjoint_solve(), and libMesh::LaspackLinearSolver< T >::solve().

◆ _row_start

template<typename T>

std::vector<std::vector<numeric_index_type>::const_iterator> libMesh::LaspackMatrix< T >::_row_start

private

The start of each row in the compressed row index data structure.

Definition at line 194 of file laspack_matrix.h.

◆ _sp

template<typename T>

SparsityPattern::Build const* libMesh::SparseMatrix< T >::_sp

protectedinherited

The sparsity pattern associated with this object.

Should be queried for entry counts (or with need_full_sparsity_pattern, patterns) when needed.

Definition at line 574 of file sparse_matrix.h.

The documentation for this class was generated from the following files:

include/numerics/laspack_matrix.h
src/numerics/laspack_matrix.C

Public Member Functions

Static Public Member Functions

Protected Types

Protected Member Functions

Protected Attributes

Static Protected Attributes

Private Member Functions

Private Attributes

Friends

Detailed Description

template<typename T> class libMesh::LaspackMatrix< T >

Member Typedef Documentation

◆ Counts

Constructor & Destructor Documentation

◆ LaspackMatrix() [1/3]

◆ LaspackMatrix() [2/3]

◆ LaspackMatrix() [3/3]

◆ ~LaspackMatrix()

Member Function Documentation

◆ _get_submatrix()

◆ add() [1/2]

◆ add() [2/2]

◆ add_block_matrix() [1/2]

◆ add_block_matrix() [2/2]

◆ add_matrix() [1/2]

◆ add_matrix() [2/2]

◆ add_sparse_matrix()

◆ attach_dof_map()

◆ attach_sparsity_pattern()

◆ build()

◆ clear()

◆ clone()

◆ close()

◆ closed()

◆ col_start()

◆ col_stop()

◆ comm()

◆ create_submatrix()

◆ create_submatrix_nosort()

◆ disable_print_counter_info()

◆ enable_print_counter_info()

◆ flush()

◆ get_diagonal()

◆ get_info()

◆ get_row()

◆ get_transpose()

◆ increment_constructor_count()

◆ increment_destructor_count()

◆ init() [1/2]

◆ init() [2/2]

◆ initialized()

◆ l1_norm()

◆ linfty_norm()

◆ local_m()

◆ local_n()

◆ m()

◆ matrix_matrix_mult()

◆ n()

◆ n_nonzeros()

◆ n_objects()

◆ n_processors()

◆ need_full_sparsity_pattern()

◆ operator()()

◆ operator=() [1/2]

◆ operator=() [2/2]

◆ pos()

◆ print() [1/2]

◆ print() [2/2]

◆ print_info()

◆ print_matlab()

◆ print_personal()

◆ print_petsc_binary()

◆ print_petsc_hdf5()

◆ processor_id()

◆ read_matlab()

◆ read_petsc_binary()

◆ read_petsc_hdf5()

◆ reinit_submatrix()

◆ row_start()

◆ row_stop()

template<typename T>
class libMesh::LaspackMatrix< T >