Dear All, I have a STL array of parallel distributed vectors
*std::vector<VectorType> X;* In the above VectorType denotes parallel::distributed::Vector<double>. The size of X (numVectorsX) can be close to 5,000 to 10,000 for very large problems. All these vectors in X form a subspace and I would like to evaluate the overlap matrix associated with these vectors i.e I would like to evaluate the matrix A = Q^T*Q where Q is the matrix whose column vectors are the vectors in X and the matrix A is a square matrix with dimension equal to numVectorsX. I was wondering if anyone can suggest a computationally efficient way of evaluating this overlap matrix A using deal ii functionality. Thanks and Regards Phani -- The deal.II project is located at http://www.dealii.org/ For mailing list/forum options, see https://groups.google.com/d/forum/dealii?hl=en --- You received this message because you are subscribed to the Google Groups "deal.II User Group" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
