find_cell_* \
sparse_matrix_* \
full_matrix_vector_* \
- solver_selector
+ solver_selector \
+ deal_solver_*
ifeq ($(USE_CONTRIB_PETSC),yes)
tests_x += vector_* petsc_*
--- /dev/null
+//---------------------------- deal_solver_01.cc ---------------------------
+// deal_solver_01.cc,v 1.33 2003/05/30 19:19:16 guido Exp
+// Version:
+//
+// Copyright (C) 2004 by the deal.II authors
+//
+// This file is subject to QPL and may not be distributed
+// without copyright and license information. Please refer
+// to the file deal.II/doc/license.html for the text and
+// further information on this license.
+//
+//---------------------------- deal_solver_01.cc ---------------------------
+
+// test the CG solver
+
+
+#include "../tests.h"
+#include "../lac/testmatrix.h"
+#include <cmath>
+#include <fstream>
+#include <iostream>
+#include <iomanip>
+#include <base/logstream.h>
+#include <lac/sparse_matrix.h>
+#include <lac/sparse_matrix.templates.h>
+#include <lac/vector.h>
+#include <lac/vector_memory.h>
+#include <lac/solver_control.h>
+#include <lac/solver_cg.h>
+#include <lac/solver_gmres.h>
+#include <lac/solver_bicgstab.h>
+#include <lac/solver_richardson.h>
+#include <lac/solver_qmrs.h>
+#include <lac/precondition.h>
+#include <typeinfo>
+
+template<class SOLVER, class MATRIX, class VECTOR, class PRECONDITION>
+void
+check_solve( SOLVER& solver, const MATRIX& A,
+ VECTOR& u, VECTOR& f, const PRECONDITION& P)
+{
+ deallog << "Solver type: " << typeid(solver).name() << std::endl;
+
+ u = 0.;
+ f = 1.;
+ try
+ {
+ solver.solve(A,u,f,P);
+ }
+ catch (std::exception& e)
+ {
+ deallog << e.what() << std::endl;
+ abort ();
+ }
+
+ deallog << "Solver stopped after " << solver.control().last_step()
+ << " iterations" << std::endl;
+}
+
+
+int main()
+{
+ std::ofstream logfile("deal_solver_01.output");
+ logfile.precision(4);
+ deallog.attach(logfile);
+ deallog.depth_console(0);
+
+ GrowingVectorMemory<> mem;
+ SolverControl control(100, 1.e-3);
+
+ const unsigned int size = 32;
+ unsigned int dim = (size-1)*(size-1);
+
+ deallog << "Size " << size << " Unknowns " << dim << std::endl;
+
+ // Make matrix
+ FDMatrix testproblem(size, size);
+ SparsityPattern structure(dim, dim, 5);
+ testproblem.five_point_structure(structure);
+ structure.compress();
+ SparseMatrix<double> A(structure);
+ testproblem.five_point(A);
+
+ Vector<double> f(dim);
+ Vector<double> u(dim);
+ f = 1.;
+
+ SolverCG<> solver(control, mem);
+ PreconditionIdentity preconditioner;
+ check_solve (solver, A,u,f, preconditioner);
+}
+
--- /dev/null
+
+//---------------------------- deal_solver_02.cc ---------------------------
+// deal_solver_02.cc,v 1.33 2003/05/30 19:19:16 guido Exp
+// Version:
+//
+// Copyright (C) 2004 by the deal.II authors
+//
+// This file is subject to QPL and may not be distributed
+// without copyright and license information. Please refer
+// to the file deal.II/doc/license.html for the text and
+// further information on this license.
+//
+//---------------------------- deal_solver_02.cc ---------------------------
+
+// test the BiCGStab solver
+
+
+
+#include "../tests.h"
+#include "../lac/testmatrix.h"
+#include <cmath>
+#include <fstream>
+#include <iostream>
+#include <iomanip>
+#include <base/logstream.h>
+#include <lac/sparse_matrix.h>
+#include <lac/sparse_matrix.templates.h>
+#include <lac/vector.h>
+#include <lac/vector_memory.h>
+#include <lac/solver_control.h>
+#include <lac/solver_cg.h>
+#include <lac/solver_gmres.h>
+#include <lac/solver_bicgstab.h>
+#include <lac/solver_richardson.h>
+#include <lac/solver_qmrs.h>
+#include <lac/precondition.h>
+#include <typeinfo>
+
+template<class SOLVER, class MATRIX, class VECTOR, class PRECONDITION>
+void
+check_solve( SOLVER& solver, const MATRIX& A,
+ VECTOR& u, VECTOR& f, const PRECONDITION& P)
+{
+ deallog << "Solver type: " << typeid(solver).name() << std::endl;
+
+ u = 0.;
+ f = 1.;
+ try
+ {
+ solver.solve(A,u,f,P);
+ }
+ catch (std::exception& e)
+ {
+ deallog << e.what() << std::endl;
+ abort ();
+ }
+
+ deallog << "Solver stopped after " << solver.control().last_step()
+ << " iterations" << std::endl;
+}
+
+
+int main()
+{
+ std::ofstream logfile("deal_solver_02.output");
+ logfile.precision(4);
+ deallog.attach(logfile);
+ deallog.depth_console(0);
+
+ GrowingVectorMemory<> mem;
+ SolverControl control(100, 1.e-3);
+
+ const unsigned int size = 32;
+ unsigned int dim = (size-1)*(size-1);
+
+ deallog << "Size " << size << " Unknowns " << dim << std::endl;
+
+ // Make matrix
+ FDMatrix testproblem(size, size);
+ SparsityPattern structure(dim, dim, 5);
+ testproblem.five_point_structure(structure);
+ structure.compress();
+ SparseMatrix<double> A(structure);
+ testproblem.five_point(A);
+
+ Vector<double> f(dim);
+ Vector<double> u(dim);
+ f = 1.;
+
+ SolverBicgstab<> solver(control, mem);
+ PreconditionIdentity preconditioner;
+ check_solve (solver, A,u,f, preconditioner);
+}
+
--- /dev/null
+
+//---------------------------- deal_solver_03.cc ---------------------------
+// deal_solver_03.cc,v 1.33 2003/05/30 19:19:16 guido Exp
+// Version:
+//
+// Copyright (C) 2004 by the deal.II authors
+//
+// This file is subject to QPL and may not be distributed
+// without copyright and license information. Please refer
+// to the file deal.II/doc/license.html for the text and
+// further information on this license.
+//
+//---------------------------- deal_solver_03.cc ---------------------------
+
+// test the GMRES solver
+
+
+
+#include "../tests.h"
+#include "../lac/testmatrix.h"
+#include <cmath>
+#include <fstream>
+#include <iostream>
+#include <iomanip>
+#include <base/logstream.h>
+#include <lac/sparse_matrix.h>
+#include <lac/sparse_matrix.templates.h>
+#include <lac/vector.h>
+#include <lac/vector_memory.h>
+#include <lac/solver_control.h>
+#include <lac/solver_cg.h>
+#include <lac/solver_gmres.h>
+#include <lac/solver_bicgstab.h>
+#include <lac/solver_richardson.h>
+#include <lac/solver_qmrs.h>
+#include <lac/precondition.h>
+#include <typeinfo>
+
+template<class SOLVER, class MATRIX, class VECTOR, class PRECONDITION>
+void
+check_solve( SOLVER& solver, const MATRIX& A,
+ VECTOR& u, VECTOR& f, const PRECONDITION& P)
+{
+ deallog << "Solver type: " << typeid(solver).name() << std::endl;
+
+ u = 0.;
+ f = 1.;
+ try
+ {
+ solver.solve(A,u,f,P);
+ }
+ catch (std::exception& e)
+ {
+ deallog << e.what() << std::endl;
+ abort ();
+ }
+
+ deallog << "Solver stopped after " << solver.control().last_step()
+ << " iterations" << std::endl;
+}
+
+
+int main()
+{
+ std::ofstream logfile("deal_solver_03.output");
+ logfile.precision(4);
+ deallog.attach(logfile);
+ deallog.depth_console(0);
+
+ GrowingVectorMemory<> mem;
+ SolverControl control(100, 1.e-3);
+
+ const unsigned int size = 32;
+ unsigned int dim = (size-1)*(size-1);
+
+ deallog << "Size " << size << " Unknowns " << dim << std::endl;
+
+ // Make matrix
+ FDMatrix testproblem(size, size);
+ SparsityPattern structure(dim, dim, 5);
+ testproblem.five_point_structure(structure);
+ structure.compress();
+ SparseMatrix<double> A(structure);
+ testproblem.five_point(A);
+
+ Vector<double> f(dim);
+ Vector<double> u(dim);
+ f = 1.;
+
+ SolverGMRES<> solver(control, mem);
+ PreconditionIdentity preconditioner;
+ check_solve (solver, A,u,f, preconditioner);
+}
+
--- /dev/null
+
+//---------------------------- deal_solver_04.cc ---------------------------
+// deal_solver_04.cc,v 1.33 2003/05/30 19:19:16 guido Exp
+// Version:
+//
+// Copyright (C) 2004 by the deal.II authors
+//
+// This file is subject to QPL and may not be distributed
+// without copyright and license information. Please refer
+// to the file deal.II/doc/license.html for the text and
+// further information on this license.
+//
+//---------------------------- deal_solver_04.cc ---------------------------
+
+// test the MINRES solver
+
+
+#include "../tests.h"
+#include "../lac/testmatrix.h"
+#include <cmath>
+#include <fstream>
+#include <iostream>
+#include <iomanip>
+#include <base/logstream.h>
+#include <lac/sparse_matrix.h>
+#include <lac/sparse_matrix.templates.h>
+#include <lac/vector.h>
+#include <lac/vector_memory.h>
+#include <lac/solver_control.h>
+#include <lac/solver_cg.h>
+#include <lac/solver_gmres.h>
+#include <lac/solver_minres.h>
+#include <lac/solver_bicgstab.h>
+#include <lac/solver_richardson.h>
+#include <lac/solver_qmrs.h>
+#include <lac/precondition.h>
+#include <typeinfo>
+
+template<class SOLVER, class MATRIX, class VECTOR, class PRECONDITION>
+void
+check_solve( SOLVER& solver, const MATRIX& A,
+ VECTOR& u, VECTOR& f, const PRECONDITION& P)
+{
+ deallog << "Solver type: " << typeid(solver).name() << std::endl;
+
+ u = 0.;
+ f = 1.;
+ try
+ {
+ solver.solve(A,u,f,P);
+ }
+ catch (std::exception& e)
+ {
+ deallog << e.what() << std::endl;
+ abort ();
+ }
+
+ deallog << "Solver stopped after " << solver.control().last_step()
+ << " iterations" << std::endl;
+}
+
+
+int main()
+{
+ std::ofstream logfile("deal_solver_04.output");
+ logfile.precision(4);
+ deallog.attach(logfile);
+ deallog.depth_console(0);
+
+ GrowingVectorMemory<> mem;
+ SolverControl control(100, 1.e-3);
+
+ const unsigned int size = 32;
+ unsigned int dim = (size-1)*(size-1);
+
+ deallog << "Size " << size << " Unknowns " << dim << std::endl;
+
+ // Make matrix
+ FDMatrix testproblem(size, size);
+ SparsityPattern structure(dim, dim, 5);
+ testproblem.five_point_structure(structure);
+ structure.compress();
+ SparseMatrix<double> A(structure);
+ testproblem.five_point(A);
+
+ Vector<double> f(dim);
+ Vector<double> u(dim);
+ f = 1.;
+
+ SolverMinRes<> solver(control, mem);
+ PreconditionIdentity preconditioner;
+ check_solve (solver, A,u,f, preconditioner);
+}
+
--- /dev/null
+
+//---------------------------- deal_solver_05.cc ---------------------------
+// deal_solver_05.cc,v 1.33 2003/05/30 19:19:16 guido Exp
+// Version:
+//
+// Copyright (C) 2004 by the deal.II authors
+//
+// This file is subject to QPL and may not be distributed
+// without copyright and license information. Please refer
+// to the file deal.II/doc/license.html for the text and
+// further information on this license.
+//
+//---------------------------- deal_solver_05.cc ---------------------------
+
+// test the QMRS solver
+
+
+#include "../tests.h"
+#include "../lac/testmatrix.h"
+#include <cmath>
+#include <fstream>
+#include <iostream>
+#include <iomanip>
+#include <base/logstream.h>
+#include <lac/sparse_matrix.h>
+#include <lac/sparse_matrix.templates.h>
+#include <lac/vector.h>
+#include <lac/vector_memory.h>
+#include <lac/solver_control.h>
+#include <lac/solver_cg.h>
+#include <lac/solver_gmres.h>
+#include <lac/solver_bicgstab.h>
+#include <lac/solver_richardson.h>
+#include <lac/solver_qmrs.h>
+#include <lac/precondition.h>
+#include <typeinfo>
+
+template<class SOLVER, class MATRIX, class VECTOR, class PRECONDITION>
+void
+check_solve( SOLVER& solver, const MATRIX& A,
+ VECTOR& u, VECTOR& f, const PRECONDITION& P)
+{
+ deallog << "Solver type: " << typeid(solver).name() << std::endl;
+
+ u = 0.;
+ f = 1.;
+ try
+ {
+ solver.solve(A,u,f,P);
+ }
+ catch (std::exception& e)
+ {
+ deallog << e.what() << std::endl;
+ abort ();
+ }
+
+ deallog << "Solver stopped after " << solver.control().last_step()
+ << " iterations" << std::endl;
+}
+
+
+int main()
+{
+ std::ofstream logfile("deal_solver_05.output");
+ logfile.precision(4);
+ deallog.attach(logfile);
+ deallog.depth_console(0);
+
+ GrowingVectorMemory<> mem;
+ SolverControl control(100, 1.e-3);
+
+ const unsigned int size = 32;
+ unsigned int dim = (size-1)*(size-1);
+
+ deallog << "Size " << size << " Unknowns " << dim << std::endl;
+
+ // Make matrix
+ FDMatrix testproblem(size, size);
+ SparsityPattern structure(dim, dim, 5);
+ testproblem.five_point_structure(structure);
+ structure.compress();
+ SparseMatrix<double> A(structure);
+ testproblem.five_point(A);
+
+ Vector<double> f(dim);
+ Vector<double> u(dim);
+ f = 1.;
+
+ SolverQMRS<> solver(control, mem);
+ PreconditionIdentity preconditioner;
+ check_solve (solver, A,u,f, preconditioner);
+}
+
--- /dev/null
+
+//---------------------------- deal_solver_06.cc ---------------------------
+// deal_solver_06.cc,v 1.33 2003/05/30 19:19:16 guido Exp
+// Version:
+//
+// Copyright (C) 2004 by the deal.II authors
+//
+// This file is subject to QPL and may not be distributed
+// without copyright and license information. Please refer
+// to the file deal.II/doc/license.html for the text and
+// further information on this license.
+//
+//---------------------------- deal_solver_06.cc ---------------------------
+
+// test the Richardson solver
+
+
+#include "../tests.h"
+#include "../lac/testmatrix.h"
+#include <cmath>
+#include <fstream>
+#include <iostream>
+#include <iomanip>
+#include <base/logstream.h>
+#include <lac/sparse_matrix.h>
+#include <lac/sparse_matrix.templates.h>
+#include <lac/vector.h>
+#include <lac/vector_memory.h>
+#include <lac/solver_control.h>
+#include <lac/solver_cg.h>
+#include <lac/solver_gmres.h>
+#include <lac/solver_bicgstab.h>
+#include <lac/solver_richardson.h>
+#include <lac/solver_qmrs.h>
+#include <lac/precondition.h>
+#include <typeinfo>
+
+template<class SOLVER, class MATRIX, class VECTOR, class PRECONDITION>
+void
+check_solve( SOLVER& solver, const MATRIX& A,
+ VECTOR& u, VECTOR& f, const PRECONDITION& P)
+{
+ deallog << "Solver type: " << typeid(solver).name() << std::endl;
+
+ u = 0.;
+ f = 1.;
+ try
+ {
+ solver.solve(A,u,f,P);
+ }
+ catch (std::exception& e)
+ {
+ deallog << e.what() << std::endl;
+ }
+
+ deallog << "Solver stopped after " << solver.control().last_step()
+ << " iterations" << std::endl;
+}
+
+
+int main()
+{
+ std::ofstream logfile("deal_solver_06.output");
+ logfile.precision(4);
+ deallog.attach(logfile);
+ deallog.depth_console(0);
+
+ GrowingVectorMemory<> mem;
+
+ const unsigned int size = 32;
+ unsigned int dim = (size-1)*(size-1);
+ SolverControl control(10000, 1.e-3);
+
+ deallog << "Size " << size << " Unknowns " << dim << std::endl;
+
+ // Make matrix
+ FDMatrix testproblem(size, size);
+ SparsityPattern structure(dim, dim, 5);
+ testproblem.five_point_structure(structure);
+ structure.compress();
+ SparseMatrix<double> A(structure);
+ testproblem.five_point(A);
+
+ Vector<double> f(dim);
+ Vector<double> u(dim);
+ f = 1.;
+
+ SolverRichardson<> solver(control, mem);
+ PreconditionIdentity preconditioner;
+ check_solve (solver, A,u,f, preconditioner);
+}
+
--- /dev/null
+
+DEAL::Size 32 Unknowns 961
+DEAL::Solver type: 8SolverCGI6VectorIdEE
+DEAL:cg::Starting value 31.00
+DEAL:cg::Convergence step 43 value 0.0008189
+DEAL::Solver stopped after 43 iterations
+DEAL::GrowingVectorMemory:Overall allocated vectors: 4
+DEAL::GrowingVectorMemory:Maximum allocated vectors: 4
--- /dev/null
+
+DEAL::Size 32 Unknowns 961
+DEAL::Solver type: 14SolverBicgstabI6VectorIdEE
+DEAL:Bicgstab::Starting value 31.00
+DEAL:Bicgstab::Convergence step 35 value 0.0004803
+DEAL::Solver stopped after 35 iterations
+DEAL::GrowingVectorMemory:Overall allocated vectors: 8
+DEAL::GrowingVectorMemory:Maximum allocated vectors: 8
--- /dev/null
+
+DEAL::Size 32 Unknowns 961
+DEAL::Solver type: 11SolverGMRESI6VectorIdEE
+DEAL:GMRES::Starting value 31.00
+DEAL:GMRES::Convergence step 75 value 0.0008096
+DEAL::Solver stopped after 75 iterations
+DEAL::GrowingVectorMemory:Overall allocated vectors: 30
+DEAL::GrowingVectorMemory:Maximum allocated vectors: 30
--- /dev/null
+
+DEAL::Size 32 Unknowns 961
+DEAL::Solver type: 12SolverMinResI6VectorIdEE
+DEAL:minres::Starting value 31.00
+DEAL:minres::Convergence step 43 value 0.0006916
+DEAL::Solver stopped after 43 iterations
+DEAL::GrowingVectorMemory:Overall allocated vectors: 7
+DEAL::GrowingVectorMemory:Maximum allocated vectors: 7
--- /dev/null
+
+DEAL::Size 32 Unknowns 961
+DEAL::Solver type: 10SolverQMRSI6VectorIdEE
+DEAL:QMRS::Starting value 31.00
+DEAL:QMRS::Convergence step 46 value 0.0009063
+DEAL::Solver stopped after 46 iterations
+DEAL::GrowingVectorMemory:Overall allocated vectors: 5
+DEAL::GrowingVectorMemory:Maximum allocated vectors: 5
--- /dev/null
+
+DEAL::Size 32 Unknowns 961
+DEAL::Solver type: 16SolverRichardsonI6VectorIdEE
+DEAL:Richardson::Starting value 31.00
+DEAL:Richardson::Failure step 374 value nan
+DEAL::Iterative method reported convergence failure in step 374 with residual nan
+DEAL::Solver stopped after 374 iterations
+DEAL::GrowingVectorMemory:Overall allocated vectors: 2
+DEAL::GrowingVectorMemory:Maximum allocated vectors: 2