This file is indexed.

/usr/include/deal.II/lac/pointer_matrix.h is in libdeal.ii-dev 8.4.2-2+b1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
// ---------------------------------------------------------------------
//
// Copyright (C) 2002 - 2015 by the deal.II authors
//
// This file is part of the deal.II library.
//
// The deal.II library is free software; you can use it, redistribute
// it, and/or modify it under the terms of the GNU Lesser General
// Public License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
// The full text of the license can be found in the file LICENSE at
// the top level of the deal.II distribution.
//
// ---------------------------------------------------------------------

#ifndef dealii__pointer_matrix_h
#define dealii__pointer_matrix_h

#include <deal.II/base/subscriptor.h>
#include <deal.II/base/smartpointer.h>
#include <deal.II/lac/vector.h>
#include <deal.II/lac/vector_memory.h>

DEAL_II_NAMESPACE_OPEN

template<typename VectorType> class VectorMemory;

class IdentityMatrix;
template <typename number> class FullMatrix;
template <typename number> class LAPACKFullMatrix;
template <typename number> class SparseMatrix;
template <typename number> class BlockSparseMatrix;
template <typename number> class SparseMatrixEZ;
template <typename number> class BlockSparseMatrixEZ;
template <typename number> class TridiagonalMatrix;
template <typename number, typename BlockVectorType> class BlockMatrixArray;

/*! @addtogroup Matrix2
 *@{
 */

/**
 * Abstract class for use in iterations.  This class provides the interface
 * required by LAC solver classes. It allows to use different concrete matrix
 * classes in the same context, as long as they apply to the same vector
 * class.
 *
 * @author Guido Kanschat, 2000, 2001, 2002
 */
template<typename VectorType>
class PointerMatrixBase : public Subscriptor
{
public:
  /**
   * Value type of this matrix. since the matrix itself is unknown, we take
   * the value type of the vector. Therefore, matrix entries must be
   * convertible to vector entries.
   *
   * This was defined to make this matrix a possible template argument to
   * BlockMatrixArray.
   */
  typedef typename VectorType::value_type value_type;

  /**
   * Virtual destructor.  Does nothing except making sure that the destructor
   * of any derived class is called whenever a pointer-to-base-class object is
   * destroyed.
   */
  virtual ~PointerMatrixBase ();

  /**
   * Reset the object to its original state.
   */
  virtual void clear () = 0;

  /**
   * Matrix-vector product.
   */
  virtual void vmult (VectorType       &dst,
                      const VectorType &src) const = 0;

  /**
   * Transposed matrix-vector product.
   */
  virtual void Tvmult (VectorType       &dst,
                       const VectorType &src) const = 0;

  /**
   * Matrix-vector product, adding to <tt>dst</tt>.
   */
  virtual void vmult_add (VectorType       &dst,
                          const VectorType &src) const = 0;

  /**
   * Transposed matrix-vector product, adding to <tt>dst</tt>.
   */
  virtual void Tvmult_add (VectorType       &dst,
                           const VectorType &src) const = 0;
};


/**
 * A pointer to be used as a matrix.  This class stores a pointer to a matrix
 * and can be used as a matrix itself in iterative methods.
 *
 * The main purpose for the existence of this class is its base class, which
 * only has a vector as template argument. Therefore, this interface provides
 * an abstract base class for matrices.
 *
 * @author Guido Kanschat 2000, 2001, 2002
 */
template<typename MatrixType, typename VectorType>
class PointerMatrix : public PointerMatrixBase<VectorType>
{
public:
  /**
   * Constructor.  The pointer in the argument is stored in this class. As
   * usual, the lifetime of <tt>*M</tt> must be longer than the one of the
   * PointerMatrix.
   *
   * If <tt>M</tt> is zero, no matrix is stored.
   */
  PointerMatrix (const MatrixType *M=0);

  /**
   * Constructor.
   *
   * This class internally stores a pointer to a matrix via a SmartPointer
   * object. The SmartPointer class allows to associate a name with the object
   * pointed to that identifies the object that has the pointer, in order to
   * identify objects that still refer to the object pointed to. The @p name
   * argument to this function is used to this end, i.e., you can in essence
   * assign a name to the current PointerMatrix object.
   */
  PointerMatrix(const char *name);

  /**
   * Constructor. <tt>M</tt> points to a matrix which must live longer than
   * the PointerMatrix.
   *
   * This class internally stores a pointer to a matrix via a SmartPointer
   * object. The SmartPointer class allows to associate a name with the object
   * pointed to that identifies the object that has the pointer, in order to
   * identify objects that still refer to the object pointed to. The @p name
   * argument to this function is used to this end, i.e., you can in essence
   * assign a name to the current PointerMatrix object.
   */
  PointerMatrix(const MatrixType *M,
                const char *name);

  // Use doc from base class
  virtual void clear();

  /**
   * Return whether the object is empty.
   */
  bool empty () const;

  /**
   * Assign a new matrix pointer. Deletes the old pointer and releases its
   * matrix.
   * @see SmartPointer
   */
  const PointerMatrix &operator= (const MatrixType *M);

  /**
   * Matrix-vector product.
   */
  virtual void vmult (VectorType       &dst,
                      const VectorType &src) const;

  /**
   * Transposed matrix-vector product.
   */
  virtual void Tvmult (VectorType       &dst,
                       const VectorType &src) const;

  /**
   * Matrix-vector product, adding to <tt>dst</tt>.
   */
  virtual void vmult_add (VectorType       &dst,
                          const VectorType &src) const;

  /**
   * Transposed matrix-vector product, adding to <tt>dst</tt>.
   */
  virtual void Tvmult_add (VectorType       &dst,
                           const VectorType &src) const;

private:
  /**
   * The pointer to the actual matrix.
   */
  SmartPointer<const MatrixType,PointerMatrix<MatrixType,VectorType> > m;
};


/**
 * A pointer to be used as a matrix.  This class stores a pointer to a matrix
 * and can be used as a matrix itself in iterative methods.
 *
 * The main purpose for the existence of this class is its base class, which
 * only has a vector as template argument. Therefore, this interface provides
 * an abstract base class for matrices.
 *
 * This class differs form PointerMatrix by its additional VectorMemory object
 * and by the fact that it implements the functions vmult_add() and
 * Tvmult_add() only using vmult() and Tvmult() of the MatrixType.
 *
 * @author Guido Kanschat 2006
 */
template<typename MatrixType, typename VectorType>
class PointerMatrixAux : public PointerMatrixBase<VectorType>
{
public:
  /**
   * Constructor.  The pointer in the argument is stored in this class. As
   * usual, the lifetime of <tt>*M</tt> must be longer than the one of the
   * PointerMatrixAux.
   *
   * If <tt>M</tt> is zero, no matrix is stored.
   *
   * If <tt>mem</tt> is zero, then GrowingVectorMemory is used.
   */
  PointerMatrixAux (VectorMemory<VectorType> *mem = 0,
                    const MatrixType         *M = 0);

  /**
   * Constructor not using a matrix.
   *
   * This class internally stores a pointer to a matrix via a SmartPointer
   * object. The SmartPointer class allows to associate a name with the object
   * pointed to that identifies the object that has the pointer, in order to
   * identify objects that still refer to the object pointed to. The @p name
   * argument to this function is used to this end, i.e., you can in essence
   * assign a name to the current PointerMatrix object.
   */
  PointerMatrixAux(VectorMemory<VectorType> *mem,
                   const char               *name);

  /**
   * Constructor. <tt>M</tt> points to a matrix which must live longer than
   * the PointerMatrixAux.
   *
   * This class internally stores a pointer to a matrix via a SmartPointer
   * object. The SmartPointer class allows to associate a name with the object
   * pointed to that identifies the object that has the pointer, in order to
   * identify objects that still refer to the object pointed to. The @p name
   * argument to this function is used to this end, i.e., you can in essence
   * assign a name to the current PointerMatrix object.
   */
  PointerMatrixAux(VectorMemory<VectorType> *mem,
                   const MatrixType         *M,
                   const char               *name);

  // Use doc from base class
  virtual void clear();

  /**
   * Return whether the object is empty.
   */
  bool empty () const;

  /**
   * Assign a new VectorMemory object for getting auxiliary vectors.
   */
  void set_memory(VectorMemory<VectorType> *mem);

  /**
   * Assign a new matrix pointer. Deletes the old pointer and releases its
   * matrix.
   * @see SmartPointer
   */
  const PointerMatrixAux &operator= (const MatrixType *M);

  /**
   * Matrix-vector product.
   */
  virtual void vmult (VectorType       &dst,
                      const VectorType &src) const;

  /**
   * Transposed matrix-vector product.
   */
  virtual void Tvmult (VectorType       &dst,
                       const VectorType &src) const;

  /**
   * Matrix-vector product, adding to <tt>dst</tt>.
   */
  virtual void vmult_add (VectorType       &dst,
                          const VectorType &src) const;

  /**
   * Transposed matrix-vector product, adding to <tt>dst</tt>.
   */
  virtual void Tvmult_add (VectorType       &dst,
                           const VectorType &src) const;

private:
  /**
   * The backup memory if none was provided.
   */
  mutable GrowingVectorMemory<VectorType> my_memory;

  /**
   * Object for getting the auxiliary vector.
   */
  mutable SmartPointer<VectorMemory<VectorType>,PointerMatrixAux<MatrixType,VectorType> > mem;

  /**
   * The pointer to the actual matrix.
   */
  SmartPointer<const MatrixType,PointerMatrixAux<MatrixType,VectorType> > m;
};



/**
 * Implement matrix multiplications for a vector using the PointerMatrixBase
 * functionality. Objects of this class can be used in block matrices.
 *
 * Implements a matrix with image dimension 1 by using the scalar product
 * (#vmult()) and scalar multiplication (#Tvmult()) functions of the Vector
 * class.
 *
 * @author Guido Kanschat, 2006
 */
template <typename number>
class PointerMatrixVector : public PointerMatrixBase<Vector<number> >
{
public:
  /**
   * Constructor.  The pointer in the argument is stored in this class. As
   * usual, the lifetime of <tt>*M</tt> must be longer than the one of the
   * PointerMatrix.
   *
   * If <tt>M</tt> is zero, no matrix is stored.
   */
  PointerMatrixVector (const Vector<number> *M=0);

  /**
   * Constructor.
   *
   * This class internally stores a pointer to a matrix via a SmartPointer
   * object. The SmartPointer class allows to associate a name with the object
   * pointed to that identifies the object that has the pointer, in order to
   * identify objects that still refer to the object pointed to. The @p name
   * argument to this function is used to this end, i.e., you can in essence
   * assign a name to the current PointerMatrix object.
   */
  PointerMatrixVector (const char *name);

  /**
   * Constructor. <tt>M</tt> points to a matrix which must live longer than
   * the PointerMatrix.
   *
   * This class internally stores a pointer to a matrix via a SmartPointer
   * object. The SmartPointer class allows to associate a name with the object
   * pointed to that identifies the object that has the pointer, in order to
   * identify objects that still refer to the object pointed to. The @p name
   * argument to this function is used to this end, i.e., you can in essence
   * assign a name to the current PointerMatrix object.
   */
  PointerMatrixVector (const Vector<number> *M,
                       const char *name);

  // Use doc from base class
  virtual void clear();

  /**
   * Return whether the object is empty.
   */
  bool empty () const;

  /**
   * Assign a new matrix pointer. Deletes the old pointer and releases its
   * matrix.
   * @see SmartPointer
   */
  const PointerMatrixVector &operator= (const Vector<number> *M);

  /**
   * Matrix-vector product, actually the scalar product of <tt>src</tt> and
   * the vector representing this matrix.
   *
   * The dimension of <tt>dst</tt> is 1, while that of <tt>src</tt> is the
   * size of the vector representing this matrix.
   */
  virtual void vmult (Vector<number> &dst,
                      const Vector<number> &src) const;

  /**
   * Transposed matrix-vector product, actually the multiplication of the
   * vector representing this matrix with <tt>src(0)</tt>.
   *
   * The dimension of <tt>src</tt> is 1, while that of <tt>dst</tt> is the
   * size of the vector representing this matrix.
   */
  virtual void Tvmult (Vector<number> &dst,
                       const Vector<number> &src) const;

  /**
   * Matrix-vector product, adding to <tt>dst</tt>.
   *
   * The dimension of <tt>dst</tt> is 1, while that of <tt>src</tt> is the
   * size of the vector representing this matrix.
   */
  virtual void vmult_add (Vector<number> &dst,
                          const Vector<number> &src) const;

  /**
   * Transposed matrix-vector product, adding to <tt>dst</tt>.
   *
   * The dimension of <tt>src</tt> is 1, while that of <tt>dst</tt> is the
   * size of the vector representing this matrix.
   */
  virtual void Tvmult_add (Vector<number> &dst,
                           const Vector<number> &src) const;

private:
  /**
   * The pointer to the actual matrix.
   */
  SmartPointer<const Vector<number>,PointerMatrixVector<number> > m;
};



/**
 * This function helps you creating a PointerMatrixBase object if you do not
 * want to provide the full template arguments of PointerMatrix or
 * PointerMatrixAux.
 *
 * Note that this function by default creates a PointerMatrixAux, emulating
 * the functions <tt>vmult_add</tt> and <tt>Tvmult_add</tt>, using an
 * auxiliary vector. It is overloaded for the library matrix classes
 * implementing these functions themselves. If you have such a class, you
 * should overload the function in order to save memory and time.
 *
 * The result is a PointerMatrixBase* pointing to <tt>matrix</tt>. The
 * <tt>VectorType</tt> argument is a dummy just used to determine the template
 * arguments.
 *
 * @relates PointerMatrixBase @relates PointerMatrixAux
 */
template <typename VectorType, typename MatrixType>
inline
PointerMatrixBase<VectorType> *
new_pointer_matrix_base(MatrixType &matrix, const VectorType &, const char *name = "PointerMatrixAux")
{
  return new PointerMatrixAux<MatrixType, VectorType>(0, &matrix, name);
}

/**
 * Specialized version for IdentityMatrix.
 *
 * @relates PointerMatrixBase @relates PointerMatrix
 */
template <typename numberv>
PointerMatrixBase<Vector<numberv> > *
new_pointer_matrix_base(const IdentityMatrix &matrix, const Vector<numberv> &, const char *name = "PointerMatrix")
{
  return new PointerMatrix<IdentityMatrix, Vector<numberv> >(&matrix, name);
}


/**
 * Specialized version for FullMatrix.
 *
 * @relates PointerMatrixBase @relates PointerMatrix
 */
template <typename numberv, typename numberm>
PointerMatrixBase<Vector<numberv> > *
new_pointer_matrix_base(const FullMatrix<numberm> &matrix, const Vector<numberv> &, const char *name = "PointerMatrix")
{
  return new PointerMatrix<FullMatrix<numberm>, Vector<numberv> >(&matrix, name);
}


/**
 * Specialized version for LAPACKFullMatrix.
 *
 * @relates PointerMatrixBase @relates PointerMatrix
 */
template <typename numberv, typename numberm>
PointerMatrixBase<Vector<numberv> > *
new_pointer_matrix_base(const LAPACKFullMatrix<numberm> &matrix, const Vector<numberv> &, const char *name = "PointerMatrix")
{
  return new PointerMatrix<LAPACKFullMatrix<numberm>, Vector<numberv> >(&matrix, name);
}


/**
 * Specialized version for SparseMatrix.
 *
 * @relates PointerMatrixBase @relates PointerMatrix
 */
template <typename numberv, typename numberm>
PointerMatrixBase<Vector<numberv> > *
new_pointer_matrix_base(const SparseMatrix<numberm> &matrix, const Vector<numberv> &, const char *name = "PointerMatrix")
{
  return new PointerMatrix<SparseMatrix<numberm>, Vector<numberv> >(&matrix, name);
}


/**
 * Specialized version for BlockSparseMatrix.
 *
 * @relates PointerMatrixBase @relates PointerMatrix
 */
template <typename VectorType, typename numberm>
PointerMatrixBase<VectorType> *
new_pointer_matrix_base(const BlockSparseMatrix<numberm> &matrix, const VectorType &, const char *name = "PointerMatrix")
{
  return new PointerMatrix<BlockSparseMatrix<numberm>, VectorType>(&matrix, name);
}


/**
 * Specialized version for SparseMatrixEZ.
 *
 * @relates PointerMatrixBase @relates PointerMatrix
 */
template <typename numberv, typename numberm>
PointerMatrixBase<Vector<numberv> > *
new_pointer_matrix_base(const SparseMatrixEZ<numberm> &matrix, const Vector<numberv> &, const char *name = "PointerMatrix")
{
  return new PointerMatrix<SparseMatrixEZ<numberm>, Vector<numberv> >(&matrix, name);
}


/**
 * Specialized version for BlockSparseMatrixEZ.
 *
 * @relates PointerMatrixBase @relates PointerMatrix
 */
template <typename VectorType, typename numberm>
PointerMatrixBase<VectorType> *
new_pointer_matrix_base(const BlockSparseMatrixEZ<numberm> &matrix, const VectorType &, const char *name = "PointerMatrix")
{
  return new PointerMatrix<BlockSparseMatrixEZ<numberm>, VectorType>(&matrix, name);
}


/**
 * Specialized version for BlockMatrixArray.
 *
 * @relates PointerMatrixBase @relates PointerMatrix
 */
template <typename numberv, typename numberm, typename BLOCK_VectorType>
PointerMatrixBase<BLOCK_VectorType> *
new_pointer_matrix_base(const BlockMatrixArray<numberm,BLOCK_VectorType> &matrix, const BLOCK_VectorType &, const char *name = "PointerMatrix")
{
  return new PointerMatrix<BlockMatrixArray<numberm,BLOCK_VectorType>, BlockVector<numberv> >(&matrix, name);
}


/**
 * Specialized version for TridiagonalMatrix.
 *
 * @relates PointerMatrixBase @relates PointerMatrix
 */
template <typename numberv, typename numberm>
PointerMatrixBase<Vector<numberv> > *
new_pointer_matrix_base(const TridiagonalMatrix<numberm> &matrix, const Vector<numberv> &, const char *name = "PointerMatrix")
{
  return new PointerMatrix<TridiagonalMatrix<numberm>, Vector<numberv> >(&matrix, name);
}



/*@}*/
//---------------------------------------------------------------------------

template<typename VectorType>
inline
PointerMatrixBase<VectorType>::~PointerMatrixBase ()
{}



//----------------------------------------------------------------------//


template<typename MatrixType, typename VectorType>
PointerMatrix<MatrixType, VectorType>::PointerMatrix (const MatrixType *M)
  : m(M, typeid(*this).name())
{}


template<typename MatrixType, typename VectorType>
PointerMatrix<MatrixType, VectorType>::PointerMatrix (const char *name)
  : m(0, name)
{}


template<typename MatrixType, typename VectorType>
PointerMatrix<MatrixType, VectorType>::PointerMatrix (const MatrixType *M,
                                                      const char       *name)
  : m(M, name)
{}


template<typename MatrixType, typename VectorType>
inline void
PointerMatrix<MatrixType, VectorType>::clear ()
{
  m = 0;
}


template<typename MatrixType, typename VectorType>
inline const PointerMatrix<MatrixType, VectorType> &
PointerMatrix<MatrixType, VectorType>::operator= (const MatrixType *M)
{
  m = M;
  return *this;
}


template<typename MatrixType, typename VectorType>
inline bool
PointerMatrix<MatrixType, VectorType>::empty () const
{
  if (m == 0)
    return true;
  return m->empty();
}

template<typename MatrixType, typename VectorType>
inline void
PointerMatrix<MatrixType, VectorType>::vmult (VectorType       &dst,
                                              const VectorType &src) const
{
  Assert (m != 0, ExcNotInitialized());
  m->vmult (dst, src);
}


template<typename MatrixType, typename VectorType>
inline void
PointerMatrix<MatrixType, VectorType>::Tvmult (VectorType       &dst,
                                               const VectorType &src) const
{
  Assert (m != 0, ExcNotInitialized());
  m->Tvmult (dst, src);
}


template<typename MatrixType, typename VectorType>
inline void
PointerMatrix<MatrixType, VectorType>::vmult_add (VectorType       &dst,
                                                  const VectorType &src) const
{
  Assert (m != 0, ExcNotInitialized());
  m->vmult_add (dst, src);
}


template<typename MatrixType, typename VectorType>
inline void
PointerMatrix<MatrixType, VectorType>::Tvmult_add (VectorType       &dst,
                                                   const VectorType &src) const
{
  Assert (m != 0, ExcNotInitialized());
  m->Tvmult_add (dst, src);
}



//----------------------------------------------------------------------//


template<typename MatrixType, typename VectorType>
PointerMatrixAux<MatrixType, VectorType>::PointerMatrixAux (VectorMemory<VectorType> *mem,
                                                            const MatrixType *M)
  : mem(mem, typeid(*this).name()),
    m(M, typeid(*this).name())
{
  if (mem == 0) mem = &my_memory;
}


template<typename MatrixType, typename VectorType>
PointerMatrixAux<MatrixType, VectorType>::PointerMatrixAux (VectorMemory<VectorType> *mem,
                                                            const char               *name)
  : mem(mem, name),
    m(0, name)
{
  if (mem == 0) mem = &my_memory;
}


template<typename MatrixType, typename VectorType>
PointerMatrixAux<MatrixType, VectorType>::PointerMatrixAux (VectorMemory<VectorType> *mem,
                                                            const MatrixType         *M,
                                                            const char               *name)
  : mem(mem, name),
    m(M, name)
{
  if (mem == 0) mem = &my_memory;
}


template<typename MatrixType, typename VectorType>
inline void
PointerMatrixAux<MatrixType, VectorType>::clear ()
{
  m = 0;
}


template<typename MatrixType, typename VectorType>
inline const PointerMatrixAux<MatrixType, VectorType> &
PointerMatrixAux<MatrixType, VectorType>::operator= (const MatrixType *M)
{
  m = M;
  return *this;
}


template<typename MatrixType, typename VectorType>
inline void
PointerMatrixAux<MatrixType, VectorType>::set_memory(VectorMemory<VectorType> *M)
{
  mem = M;
  if (mem == 0)
    mem = &my_memory;
}


template<typename MatrixType, typename VectorType>
inline bool
PointerMatrixAux<MatrixType, VectorType>::empty () const
{
  if (m == 0)
    return true;
  return m->empty();
}

template<typename MatrixType, typename VectorType>
inline void
PointerMatrixAux<MatrixType, VectorType>::vmult (VectorType       &dst,
                                                 const VectorType &src) const
{
  if (mem == 0)
    mem = &my_memory;
  Assert (mem != 0, ExcNotInitialized());
  Assert (m != 0, ExcNotInitialized());
  m->vmult (dst, src);
}


template<typename MatrixType, typename VectorType>
inline void
PointerMatrixAux<MatrixType, VectorType>::Tvmult (VectorType       &dst,
                                                  const VectorType &src) const
{
  if (mem == 0)
    mem = &my_memory;
  Assert (mem != 0, ExcNotInitialized());
  Assert (m != 0, ExcNotInitialized());
  m->Tvmult (dst, src);
}


template<typename MatrixType, typename VectorType>
inline void
PointerMatrixAux<MatrixType, VectorType>::vmult_add (VectorType       &dst,
                                                     const VectorType &src) const
{
  if (mem == 0)
    mem = &my_memory;
  Assert (mem != 0, ExcNotInitialized());
  Assert (m != 0, ExcNotInitialized());
  VectorType *v = mem->alloc();
  v->reinit(dst);
  m->vmult (*v, src);
  dst += *v;
  mem->free(v);
}


template<typename MatrixType, typename VectorType>
inline void
PointerMatrixAux<MatrixType, VectorType>::Tvmult_add (VectorType       &dst,
                                                      const VectorType &src) const
{
  if (mem == 0)
    mem = &my_memory;
  Assert (mem != 0, ExcNotInitialized());
  Assert (m != 0, ExcNotInitialized());
  VectorType *v = mem->alloc();
  v->reinit(dst);
  m->Tvmult (*v, src);
  dst += *v;
  mem->free(v);
}


//----------------------------------------------------------------------//


template<typename number>
PointerMatrixVector<number>::PointerMatrixVector (const Vector<number> *M)
  : m(M, typeid(*this).name())
{}


template<typename number>
PointerMatrixVector<number>::PointerMatrixVector (const char *name)
  : m(0, name)
{}


template<typename number>
PointerMatrixVector<number>::PointerMatrixVector (const Vector<number> *M,
                                                  const char           *name)
  : m(M, name)
{}


template<typename number>
inline void
PointerMatrixVector<number>::clear ()
{
  m = 0;
}


template<typename number>
inline const PointerMatrixVector<number> &
PointerMatrixVector<number>::operator= (const Vector<number> *M)
{
  m = M;
  return *this;
}


template<typename number>
inline bool
PointerMatrixVector<number>::empty () const
{
  if (m == 0)
    return true;
  return m->empty();
}

template<typename number>
inline void
PointerMatrixVector<number>::vmult (Vector<number>       &dst,
                                    const Vector<number> &src) const
{
  Assert (m != 0, ExcNotInitialized());
  Assert (dst.size() == 1, ExcDimensionMismatch(dst.size(), 1));

  dst(0) = *m * src;
}


template<typename number>
inline void
PointerMatrixVector<number>::Tvmult (Vector<number>       &dst,
                                     const Vector<number> &src) const
{
  Assert (m != 0, ExcNotInitialized());
  Assert(src.size() == 1, ExcDimensionMismatch(src.size(), 1));

  dst.equ (src(0), *m);
}


template<typename number>
inline void
PointerMatrixVector<number>::vmult_add (Vector<number>       &dst,
                                        const Vector<number> &src) const
{
  Assert (m != 0, ExcNotInitialized());
  Assert (dst.size() == 1, ExcDimensionMismatch(dst.size(), 1));

  dst(0) += *m * src;
}


template<typename number>
inline void
PointerMatrixVector<number>::Tvmult_add (Vector<number>       &dst,
                                         const Vector<number> &src) const
{
  Assert (m != 0, ExcNotInitialized());
  Assert(src.size() == 1, ExcDimensionMismatch(src.size(), 1));

  dst.add (src(0), *m);
}


DEAL_II_NAMESPACE_CLOSE

#endif