Method MultiMultSeed

linalg/cg.cpp:253–500

  template <class IPTYPE>
  void CGSolver<IPTYPE> :: MultiMultSeed (const BaseVector & f, BaseVector & u, const int dim) const
  {
    try
      {
	// Solve A u = f
        BaseStatusHandler::SetThreadPercentage(0);
 
	SCAL * pl;
	const SCAL * pr;
	int i;

	auto d = f.CreateVector();

	BaseMatrix * smalla;
        /*
	if(dynamic_cast< const SparseMatrixSymmetricTM<SCAL> *>(a))
	  smalla = new SparseMatrixSymmetric<SCAL,SCAL>(*dynamic_cast< const SparseMatrixSymmetricTM<SCAL> *>(a));
	else
        */
        if (dynamic_cast< const SparseMatrixTM<SCAL> *>(a.get()))
	  smalla = new SparseMatrix<SCAL,SCAL>(*dynamic_cast< const SparseMatrixTM<SCAL> *>(a.get()));
	else
	  throw Exception("Assumption about bilinearform wrong.");


	//BaseVector & aux1 = (smalla) ? d : *f.CreateVector();
	//BaseVector & aux2 = (smalla) ? d : *f.CreateVector();
	

	VVector<SCAL> w(f.Size());
	VVector<SCAL> d_reduced(f.Size());
	VVector<SCAL> s(f.Size());

	int n = 0;

	SCAL be,wd,wdn,kss;
	Vector<SCAL> al(dim);
	Array<double> err(dim);

	if (initialize)
	  {
	    u = 0.0;
	    d = f;
	  }
	else
	  {
	    d = f - (*a) * u;
	  }

		
	double lwstart;
	double lerr;
	


	for(int seed = dim-1; seed >= 0; seed--)
	  {