-
Notifications
You must be signed in to change notification settings - Fork 707
/
trilinos_solver.h
1398 lines (1194 loc) · 43 KB
/
trilinos_solver.h
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
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// ------------------------------------------------------------------------
//
// SPDX-License-Identifier: LGPL-2.1-or-later
// Copyright (C) 2008 - 2024 by the deal.II authors
//
// This file is part of the deal.II library.
//
// Part of the source code is dual licensed under Apache-2.0 WITH
// LLVM-exception OR LGPL-2.1-or-later. Detailed license information
// governing the source code and code contributions can be found in
// LICENSE.md and CONTRIBUTING.md at the top level directory of deal.II.
//
// ------------------------------------------------------------------------
#ifndef dealii_trilinos_solver_h
#define dealii_trilinos_solver_h
#include <deal.II/base/config.h>
#ifdef DEAL_II_WITH_TRILINOS
# include <deal.II/base/template_constraints.h>
# include <deal.II/lac/exceptions.h>
# include <deal.II/lac/la_parallel_vector.h>
# include <deal.II/lac/solver_control.h>
# include <deal.II/lac/vector.h>
// for AztecOO solvers
# include <Amesos.h>
# include <AztecOO.h>
# include <Epetra_LinearProblem.h>
# include <Epetra_Operator.h>
// for Belos solvers
# ifdef DEAL_II_TRILINOS_WITH_BELOS
# include <BelosBlockCGSolMgr.hpp>
# include <BelosBlockGmresSolMgr.hpp>
# include <BelosEpetraAdapter.hpp>
# include <BelosIteration.hpp>
# include <BelosMultiVec.hpp>
# include <BelosOperator.hpp>
# include <BelosSolverManager.hpp>
# endif
# include <memory>
DEAL_II_NAMESPACE_OPEN
namespace TrilinosWrappers
{
// forward declarations
# ifndef DOXYGEN
class SparseMatrix;
class PreconditionBase;
# endif
/**
* Base class for solver classes using the Trilinos solvers. Since solvers
* in Trilinos are selected based on flags passed to a generic solver
* object, basically all the actual solver calls happen in this class, and
* derived classes simply set the right flags to select one solver or
* another, or to set certain parameters for individual solvers. For a
* general discussion on the Trilinos solver package AztecOO, we refer to
* the <a
* href="https://trilinos.org/docs/dev/packages/aztecoo/doc/html/index.html">AztecOO
* user guide</a>.
*
* This solver class can also be used as a standalone class, where the
* respective Krylov method is set via the flag <tt>solver_name</tt>. This
* can be done at runtime (e.g., when parsing the solver from a
* ParameterList) and is similar to the deal.II class SolverSelector.
*
* @ingroup TrilinosWrappers
*/
class SolverBase
{
public:
/**
* Enumeration object that is set in the constructor of the derived
* classes and tells Trilinos which solver to use. This option can also be
* set in the user program, so one might use this base class instead of
* one of the specialized derived classes when the solver should be set at
* runtime. Currently enabled options are:
*/
enum SolverName
{
/**
* Use the conjugate gradient (CG) algorithm.
*/
cg,
/**
* Use the conjugate gradient squared (CGS) algorithm.
*/
cgs,
/**
* Use the generalized minimum residual (GMRES) algorithm.
*/
gmres,
/**
* Use the biconjugate gradient stabilized (BICGStab) algorithm.
*/
bicgstab,
/**
* Use the transpose-free quasi-minimal residual (TFQMR) method.
*/
tfqmr
} solver_name;
/**
* Standardized data struct to pipe additional data to the solver.
*/
struct AdditionalData
{
/**
* Set the additional data field to the desired output format and puts
* the restart parameter in case the derived class is GMRES.
*
* TODO: Find a better way for setting the GMRES restart parameter since
* it is quite inelegant to set a specific option of one solver in the
* base class for all solvers.
*/
explicit AdditionalData(const bool output_solver_details = false,
const unsigned int gmres_restart_parameter = 30);
/**
* Enables/disables the output of solver details (residual in each
* iterations etc.).
*/
const bool output_solver_details;
/**
* Restart parameter for GMRES solver.
*/
const unsigned int gmres_restart_parameter;
};
/**
* Constructor. Takes the solver control object and creates the solver.
*/
SolverBase(SolverControl &cn,
const AdditionalData &data = AdditionalData());
/**
* Second constructor. This constructor takes an enum object that
* specifies the solver name and sets the appropriate Krylov method.
*/
SolverBase(const enum SolverName solver_name,
SolverControl &cn,
const AdditionalData &data = AdditionalData());
/**
* Destructor.
*/
virtual ~SolverBase() = default;
/**
* Solve the linear system <tt>Ax=b</tt>. Depending on the information
* provided by derived classes and the object passed as a preconditioner,
* one of the linear solvers and preconditioners of Trilinos is chosen.
*/
void
solve(const SparseMatrix &A,
MPI::Vector &x,
const MPI::Vector &b,
const PreconditionBase &preconditioner);
/**
* Solve the linear system <tt>Ax=b</tt> where <tt>A</tt> is an operator.
* This function can be used for matrix free computation. Depending on the
* information provided by derived classes and the object passed as a
* preconditioner, one of the linear solvers and preconditioners of
* Trilinos is chosen.
*/
void
solve(const Epetra_Operator &A,
MPI::Vector &x,
const MPI::Vector &b,
const PreconditionBase &preconditioner);
/**
* Solve the linear system <tt>Ax=b</tt> where both <tt>A</tt> and its
* @p preconditioner are an operator.
* This function can be used when both <tt>A</tt> and the @p preconditioner
* are LinearOperators derived from a TrilinosPayload.
* Depending on the information provided by derived classes and the object
* passed as a preconditioner, one of the linear solvers and preconditioners
* of Trilinos is chosen.
*/
void
solve(const Epetra_Operator &A,
MPI::Vector &x,
const MPI::Vector &b,
const Epetra_Operator &preconditioner);
/**
* Solve the linear system <tt>Ax=b</tt> where <tt>A</tt> is an operator,
* and the vectors @p x and @p b are native Trilinos vector types.
* This function can be used when <tt>A</tt> is a LinearOperators derived
* from a TrilinosPayload.
* Depending on the information provided by derived classes and the object
* passed as a preconditioner, one of the linear solvers and preconditioners
* of Trilinos is chosen.
*/
void
solve(const Epetra_Operator &A,
Epetra_MultiVector &x,
const Epetra_MultiVector &b,
const PreconditionBase &preconditioner);
/**
* Solve the linear system <tt>Ax=b</tt> where both <tt>A</tt> and its
* @p preconditioner are an operator, and the vectors @p x and @p b are
* native Trilinos vector types.
* This function can be used when both <tt>A</tt> and the @p preconditioner
* are LinearOperators derived from a TrilinosPayload.
* Depending on the information provided by derived classes and the object
* passed as a preconditioner, one of the linear solvers and preconditioners
* of Trilinos is chosen.
*/
void
solve(const Epetra_Operator &A,
Epetra_MultiVector &x,
const Epetra_MultiVector &b,
const Epetra_Operator &preconditioner);
/**
* Solve the linear system <tt>Ax=b</tt>. Depending on the information
* provided by derived classes and the object passed as a preconditioner,
* one of the linear solvers and preconditioners of Trilinos is chosen.
* This class works with matrices according to the TrilinosWrappers
* format, but can take deal.II vectors as argument. Since deal.II are
* serial vectors (not distributed), this function does only what you
* expect in case the matrix is locally owned. Otherwise, an exception
* will be thrown.
*/
void
solve(const SparseMatrix &A,
dealii::Vector<double> &x,
const dealii::Vector<double> &b,
const PreconditionBase &preconditioner);
/**
* Solve the linear system <tt>Ax=b</tt> where <tt>A</tt> is an operator.
* This function can be used for matrix free computations. Depending on
* the information provided by derived classes and the object passed as a
* preconditioner, one of the linear solvers and preconditioners of
* Trilinos is chosen. This class works with matrices according to the
* TrilinosWrappers format, but can take deal.II vectors as argument.
* Since deal.II are serial vectors (not distributed), this function does
* only what you expect in case the matrix is locally owned. Otherwise, an
* exception will be thrown.
*/
void
solve(Epetra_Operator &A,
dealii::Vector<double> &x,
const dealii::Vector<double> &b,
const PreconditionBase &preconditioner);
/**
* Solve the linear system <tt>Ax=b</tt> for deal.II's parallel
* distributed vectors. Depending on the information provided by derived
* classes and the object passed as a preconditioner, one of the linear
* solvers and preconditioners of Trilinos is chosen.
*/
void
solve(const SparseMatrix &A,
dealii::LinearAlgebra::distributed::Vector<double> &x,
const dealii::LinearAlgebra::distributed::Vector<double> &b,
const PreconditionBase &preconditioner);
/**
* Solve the linear system <tt>Ax=b</tt> where <tt>A</tt> is an operator.
* This function can be used for matrix free computation. Depending on the
* information provided by derived classes and the object passed as a
* preconditioner, one of the linear solvers and preconditioners of
* Trilinos is chosen.
*/
void
solve(Epetra_Operator &A,
dealii::LinearAlgebra::distributed::Vector<double> &x,
const dealii::LinearAlgebra::distributed::Vector<double> &b,
const PreconditionBase &preconditioner);
/**
* Access to object that controls convergence.
*/
SolverControl &
control() const;
/**
* Exception
*/
DeclException1(ExcTrilinosError,
int,
<< "An error with error number " << arg1
<< " occurred while calling a Trilinos function");
protected:
/**
* Reference to the object that controls convergence of the iterative
* solver. In fact, for these Trilinos wrappers, Trilinos does so itself,
* but we copy the data from this object before starting the solution
* process, and copy the data back into it afterwards.
*/
SolverControl &solver_control;
private:
/**
* The solve function is used to set properly the Epetra_LinearProblem,
* once it is done this function solves the linear problem.
*/
template <typename Preconditioner>
void
do_solve(const Preconditioner &preconditioner);
/**
* A function that sets the preconditioner that the solver will apply
*/
template <typename Preconditioner>
void
set_preconditioner(AztecOO &solver, const Preconditioner &preconditioner);
/**
* A structure that collects the Trilinos sparse matrix, the right hand
* side vector and the solution vector, which is passed down to the
* Trilinos solver.
*/
std::unique_ptr<Epetra_LinearProblem> linear_problem;
/**
* A structure that contains a Trilinos object that can query the linear
* solver and determine whether the convergence criterion have been met.
*/
std::unique_ptr<AztecOO_StatusTest> status_test;
/**
* A structure that contains the Trilinos solver and preconditioner
* objects.
*/
AztecOO solver;
/**
* Store a copy of the flags for this particular solver.
*/
const AdditionalData additional_data;
};
// provide a declaration for two explicit specializations
template <>
void
SolverBase::set_preconditioner(AztecOO &solver,
const PreconditionBase &preconditioner);
template <>
void
SolverBase::set_preconditioner(AztecOO &solver,
const Epetra_Operator &preconditioner);
/**
* An implementation of the solver interface using the Trilinos CG solver.
*
* @ingroup TrilinosWrappers
*/
class SolverCG : public SolverBase
{
public:
/**
* Constructor. In contrast to deal.II's own solvers, there is no need to
* give a vector memory object.
*
* The last argument takes a structure with additional, solver dependent
* flags for tuning.
*/
SolverCG(SolverControl &cn, const AdditionalData &data = AdditionalData());
};
/**
* An implementation of the solver interface using the Trilinos CGS solver.
*
* @ingroup TrilinosWrappers
*/
class SolverCGS : public SolverBase
{
public:
/**
* Constructor. In contrast to deal.II's own solvers, there is no need to
* give a vector memory object.
*
* The last argument takes a structure with additional, solver dependent
* flags for tuning.
*/
SolverCGS(SolverControl &cn, const AdditionalData &data = AdditionalData());
};
/**
* An implementation of the solver interface using the Trilinos GMRES
* solver.
*/
class SolverGMRES : public SolverBase
{
public:
/**
* Constructor. In contrast to deal.II's own solvers, there is no need to
* give a vector memory object.
*
* The last argument takes a structure with additional, solver dependent
* flags for tuning.
*/
SolverGMRES(SolverControl &cn,
const AdditionalData &data = AdditionalData());
};
/**
* An implementation of the solver interface using the Trilinos BiCGStab
* solver.
*
* @ingroup TrilinosWrappers
*/
class SolverBicgstab : public SolverBase
{
public:
/**
* Constructor. In contrast to deal.II's own solvers, there is no need to
* give a vector memory object.
*
* The last argument takes a structure with additional, solver dependent
* flags for tuning.
*/
SolverBicgstab(SolverControl &cn,
const AdditionalData &data = AdditionalData());
};
/**
* An implementation of the solver interface using the Trilinos TFQMR
* solver.
*
* @ingroup TrilinosWrappers
*/
class SolverTFQMR : public SolverBase
{
public:
/**
* Constructor. In contrast to deal.II's own solvers, there is no need to
* give a vector memory object.
*
* The last argument takes a structure with additional, solver dependent
* flags for tuning.
*/
SolverTFQMR(SolverControl &cn,
const AdditionalData &data = AdditionalData());
};
/**
* An implementation of Trilinos direct solvers (using the Amesos package).
* The data field AdditionalData::solver_type can be used to specify the
* type of solver. It allows the use of built-in solvers Amesos_Klu as well
* as third-party solvers Amesos_Superludist or Amesos_Mumps.
*
* For instructions on how to install Trilinos for use with direct solvers
* other than KLU, see the link to the Trilinos installation instructions
* linked to from the deal.II ReadMe file.
*
* @ingroup TrilinosWrappers
*/
class SolverDirect : public Subscriptor
{
public:
/**
* Standardized data struct to pipe additional data to the solver.
*/
struct AdditionalData
{
/**
* Set the additional data field to the desired output format.
*/
explicit AdditionalData(const bool output_solver_details = false,
const std::string &solver_type = "Amesos_Klu");
/**
* Enables/disables the output of solver details (residual in each
* iterations etc.).
*/
bool output_solver_details;
/**
* Set the solver type (for third party solver support of Trilinos
* Amesos package). Possibilities are:
* <ul>
* <li> "Amesos_Lapack" </li>
* <li> "Amesos_Scalapack" </li>
* <li> "Amesos_Klu" </li>
* <li> "Amesos_Umfpack" </li>
* <li> "Amesos_Pardiso" </li>
* <li> "Amesos_Taucs" </li>
* <li> "Amesos_Superlu" </li>
* <li> "Amesos_Superludist" </li>
* <li> "Amesos_Dscpack" </li>
* <li> "Amesos_Mumps" </li>
* </ul>
* Note that the availability of these solvers in deal.II depends on
* which solvers were set when configuring Trilinos.
*/
std::string solver_type;
};
/**
* Constructor. Creates the solver without solver control object.
*/
explicit SolverDirect(const AdditionalData &data = AdditionalData());
/**
* Constructor. Takes the solver control object and creates the solver.
*/
SolverDirect(SolverControl &cn,
const AdditionalData &data = AdditionalData());
/**
* Destructor.
*/
virtual ~SolverDirect() = default;
/**
* Initializes the direct solver for the matrix <tt>A</tt> and creates a
* factorization for it with the package chosen from the additional
* data structure. Note that there is no need for a preconditioner
* here and solve() is not called.
*/
void
initialize(const SparseMatrix &A);
/**
* Initializes the direct solver for the matrix <tt>A</tt> and creates a
* factorization for it with the package chosen from the additional
* data structure. Note that there is no need for a preconditioner
* here and solve() is not called. Furthermore, @p data replaces the
* data stored in this instance.
*/
void
initialize(const SparseMatrix &A, const AdditionalData &data);
/**
* Solve the linear system <tt>Ax=b</tt> based on the
* package set in the constructor on initialize(). Note the matrix is not
* refactored during this call.
*/
void
solve(MPI::Vector &x, const MPI::Vector &b);
/**
* Solve the linear system <tt>Ax=b</tt> based on the package set in
* initialize() for deal.II's own parallel vectors. Note the matrix is not
* refactored during this call.
*/
void
solve(dealii::LinearAlgebra::distributed::Vector<double> &x,
const dealii::LinearAlgebra::distributed::Vector<double> &b);
/**
* Solve the linear system <tt>Ax=b</tt> based on the
* package set in the constructor or initialize(). Note the matrix is not
* refactored during this call.
*/
void
vmult(MPI::Vector &x, const MPI::Vector &b) const;
/**
* Solve the linear system <tt>Ax=b</tt> based on the package set in
* initialize() for deal.II's own parallel vectors. Note the matrix is not
* refactored during this call.
*/
void
vmult(dealii::LinearAlgebra::distributed::Vector<double> &x,
const dealii::LinearAlgebra::distributed::Vector<double> &b) const;
/**
* Solve the linear system <tt>Ax=b</tt>. Creates a factorization of the
* matrix with the package chosen from the additional data structure and
* performs the solve. Note that there is no need for a preconditioner
* here.
*/
void
solve(const SparseMatrix &A, MPI::Vector &x, const MPI::Vector &b);
/**
* Solve the linear system <tt>Ax=b</tt>. This class works with Trilinos
* matrices, but takes deal.II serial vectors as argument. Since these
* vectors are not distributed, this function does only what you expect in
* case the matrix is serial (i.e., locally owned). Otherwise, an
* exception will be thrown.
*/
void
solve(const SparseMatrix &A,
dealii::Vector<double> &x,
const dealii::Vector<double> &b);
/**
* Solve the linear system <tt>Ax=b</tt> for deal.II's own parallel
* vectors. Creates a factorization of the matrix with the package chosen
* from the additional data structure and performs the solve. Note that
* there is no need for a preconditioner here.
*/
void
solve(const SparseMatrix &A,
dealii::LinearAlgebra::distributed::Vector<double> &x,
const dealii::LinearAlgebra::distributed::Vector<double> &b);
/**
* Access to object that controls convergence.
*/
SolverControl &
control() const;
/**
* Exception
*/
DeclException1(ExcTrilinosError,
int,
<< "An error with error number " << arg1
<< " occurred while calling a Trilinos function");
private:
/**
* Actually performs the operations for solving the linear system,
* including the factorization and forward and backward substitution.
*/
void
do_solve();
/**
* Local dummy solver control object.
*/
SolverControl solver_control_own;
/**
* Reference to the object that controls convergence of the iterative
* solver. In fact, for these Trilinos wrappers, Trilinos does so itself,
* but we copy the data from this object before starting the solution
* process, and copy the data back into it afterwards.
*/
SolverControl &solver_control;
/**
* A structure that collects the Trilinos sparse matrix, the right hand
* side vector and the solution vector, which is passed down to the
* Trilinos solver.
*/
std::unique_ptr<Epetra_LinearProblem> linear_problem;
/**
* A structure that contains the Trilinos solver and preconditioner
* objects.
*/
std::unique_ptr<Amesos_BaseSolver> solver;
/**
* Store a copy of the flags for this particular solver.
*/
AdditionalData additional_data;
};
# ifdef DEAL_II_TRILINOS_WITH_BELOS
/**
* Wrapper around the iterate solver package from the Belos
* package
* (https://docs.trilinos.org/latest-release/packages/belos/doc/html/index.html),
* targeting deal.II data structures.
*/
template <typename VectorType>
DEAL_II_CXX20_REQUIRES(concepts::is_vector_space_vector<VectorType>)
class SolverBelos
{
public:
/**
* Enumeration object that Trilinos which solver to use.
* Currently enabled options are:
*/
enum SolverName
{
/**
* Use the conjugate gradient (CG) algorithm.
*/
cg,
/**
* Use the generalized minimum residual (GMRES) algorithm.
*/
gmres,
} solver_name;
/**
* Struct that helps to configure SolverBelos. More advanced
* parameters are passed to the constructor SolverBelos
* directly via a Teuchos::ParameterList.
*/
struct AdditionalData
{
/**
* Constructor.
*/
AdditionalData(const SolverName solver_name = SolverName::cg,
const bool right_preconditioning = false)
: solver_name(solver_name)
, right_preconditioning(right_preconditioning)
{}
/**
* Solver type;
*/
SolverName solver_name;
/**
* Flag for right preconditioning.
*/
bool right_preconditioning;
};
/**
* Constructor.
*/
SolverBelos(SolverControl &solver_control,
const AdditionalData &additional_data,
const Teuchos::RCP<Teuchos::ParameterList> &belos_parameters);
/**
* Solve the linear system <tt>Ax=b</tt> with a given preconditioner.
*/
template <typename OperatorType, typename PreconditionerType>
void
solve(const OperatorType &a,
VectorType &x,
const VectorType &b,
const PreconditionerType &p);
private:
SolverControl &solver_control;
const AdditionalData additional_data;
const Teuchos::RCP<Teuchos::ParameterList> &belos_parameters;
};
# endif
} // namespace TrilinosWrappers
# ifndef DOXYGEN
# ifdef DEAL_II_TRILINOS_WITH_BELOS
namespace TrilinosWrappers
{
namespace internal
{
/**
* Implementation of the abstract interface
* Belos::MultiVec for deal.II vectors. For details,
* see
* https://docs.trilinos.org/latest-release/packages/belos/doc/html/classBelos_1_1MultiVec.html.
*/
template <typename VectorType>
DEAL_II_CXX20_REQUIRES(concepts::is_vector_space_vector<VectorType>)
class MultiVecWrapper
: public Belos::MultiVec<typename VectorType::value_type>
{
public:
/**
* Underlying value type.
*/
using value_type = typename VectorType::value_type;
/**
* Indicate that specialization exists.
*/
static bool
this_type_is_missing_a_specialization()
{
return false;
}
/**
* Constructor that takes a mutable deal.II vector.
*/
MultiVecWrapper(VectorType &vector)
{
this->vectors.resize(1);
this->vectors[0].reset(
&vector,
[](auto *) { /*Nothing to do, since vector is owned outside.*/ });
}
/**
* Constructor that takes a const deal.II vector.
*/
MultiVecWrapper(const VectorType &vector)
{
this->vectors.resize(1);
this->vectors[0].reset(
&const_cast<VectorType &>(vector),
[](auto *) { /*Nothing to do, since vector is owned outside.*/ });
}
/**
* Destructor.
*/
virtual ~MultiVecWrapper() = default;
/**
* Create a new MultiVec with numvecs columns.
*/
virtual Belos::MultiVec<value_type> *
Clone(const int numvecs) const
{
auto new_multi_vec = new MultiVecWrapper<VectorType>;
new_multi_vec->vectors.resize(numvecs);
for (auto &vec : new_multi_vec->vectors)
{
vec = std::make_shared<VectorType>();
AssertThrow(this->vectors.size() > 0, ExcInternalError());
vec->reinit(*this->vectors[0]);
}
return new_multi_vec;
}
/**
* Create a new MultiVec and copy contents of *this into it (deep copy).
*/
virtual Belos::MultiVec<value_type> *
CloneCopy() const
{
AssertThrow(false, ExcNotImplemented());
}
/**
* Creates a new Belos::MultiVec and copies the selected contents of
* *this into the new multivector (deep copy). The copied vectors
* from *this are indicated by the index.size() indices in index.
*/
virtual Belos::MultiVec<value_type> *
CloneCopy(const std::vector<int> &index) const
{
auto new_multi_vec = new MultiVecWrapper<VectorType>;
new_multi_vec->vectors.resize(index.size());
for (unsigned int i = 0; i < index.size(); ++i)
{
AssertThrow(static_cast<unsigned int>(index[i]) <
this->vectors.size(),
ExcInternalError());
new_multi_vec->vectors[i] = std::make_shared<VectorType>();
AssertIndexRange(index[i], this->vectors.size());
*new_multi_vec->vectors[i] = *this->vectors[index[i]];
}
return new_multi_vec;
}
/**
* Creates a new Belos::MultiVec that shares the selected contents
* of *this. The index of the numvecs vectors copied from *this
* are indicated by the indices given in index.
*/
virtual Belos::MultiVec<value_type> *
CloneViewNonConst(const std::vector<int> &index)
{
auto new_multi_vec = new MultiVecWrapper<VectorType>;
new_multi_vec->vectors.resize(index.size());
for (unsigned int i = 0; i < index.size(); ++i)
{
AssertThrow(static_cast<unsigned int>(index[i]) <
this->vectors.size(),
ExcInternalError());
new_multi_vec->vectors[i].reset(
this->vectors[index[i]].get(),
[](
auto
*) { /*Nothing to do, since we are creating only a view.*/ });
}
return new_multi_vec;
}
/**
* Creates a new Belos::MultiVec that shares the selected contents
* of *this. The index of the numvecs vectors copied from *this
* are indicated by the indices given in index.
*/
virtual const Belos::MultiVec<value_type> *
CloneView(const std::vector<int> &index) const
{
auto new_multi_vec = new MultiVecWrapper<VectorType>;
new_multi_vec->vectors.resize(index.size());
for (unsigned int i = 0; i < index.size(); ++i)
{
AssertThrow(static_cast<unsigned int>(index[i]) <
this->vectors.size(),
ExcInternalError());
new_multi_vec->vectors[i].reset(
this->vectors[index[i]].get(),
[](
auto
*) { /*Nothing to do, since we are creating only a view.*/ });
}
return new_multi_vec;
}
/**
* The number of rows in the multivector.
*/
virtual ptrdiff_t
GetGlobalLength() const
{
AssertThrow(this->vectors.size() > 0, ExcInternalError());
for (unsigned int i = 1; i < this->vectors.size(); ++i)
AssertDimension(this->vectors[0]->size(), this->vectors[i]->size());
return this->vectors[0]->size();
}
/**
* The number of vectors (i.e., columns) in the multivector.
*/
virtual int
GetNumberVecs() const
{
return vectors.size();
}
/**
* Update *this with alpha * A * B + beta * (*this).
*/
virtual void
MvTimesMatAddMv(const value_type alpha,
const Belos::MultiVec<value_type> &A_,
const Teuchos::SerialDenseMatrix<int, value_type> &B,
const value_type beta)
{
const auto &A = try_to_get_underlying_vector(A_);
const unsigned int n_rows = B.numRows();
const unsigned int n_cols = B.numCols();
AssertThrow(n_rows == static_cast<unsigned int>(A.GetNumberVecs()),
ExcInternalError());
AssertThrow(n_cols == static_cast<unsigned int>(this->GetNumberVecs()),
ExcInternalError());
for (unsigned int i = 0; i < n_cols; ++i)
(*this->vectors[i]) *= beta;
for (unsigned int i = 0; i < n_cols; ++i)
for (unsigned int j = 0; j < n_rows; ++j)
this->vectors[i]->add(alpha * B(j, i), *A.vectors[j]);
}
/**
* Replace *this with alpha * A + beta * B.
*/
virtual void
MvAddMv(const value_type alpha,
const Belos::MultiVec<value_type> &A_,
const value_type beta,
const Belos::MultiVec<value_type> &B_)
{
const auto &A = try_to_get_underlying_vector(A_);
const auto &B = try_to_get_underlying_vector(B_);