Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

small cleanup in tridiagonal_matrix.cc #14612

Merged
merged 1 commit into from
Dec 24, 2022
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
19 changes: 4 additions & 15 deletions source/lac/tridiagonal_matrix.cc
Original file line number Diff line number Diff line change
Expand Up @@ -90,15 +90,12 @@ TridiagonalMatrix<number>::vmult(Vector<number> & w,
if (n() == 0)
return;

// The actual loop skips the first
// and last row
// The actual loop skips the first and last row
const size_type e = n() - 1;
// Let iterators point to the first
// entry of each diagonal
// Let iterators point to the first entry of each diagonal
typename std::vector<number>::const_iterator d = diagonal.begin();
typename std::vector<number>::const_iterator r = right.begin();
// The left diagonal starts one
// later or is equal to the right
// The left diagonal starts one later or is equal to the right
// one for symmetric storage
typename std::vector<number>::const_iterator l = left.begin();
if (is_symmetric)
Expand Down Expand Up @@ -135,7 +132,7 @@ void
TridiagonalMatrix<number>::vmult_add(Vector<number> & w,
const Vector<number> &v) const
{
vmult(w, v, true);
vmult(w, v, /*adding = */ true);
}


Expand Down Expand Up @@ -269,14 +266,6 @@ TridiagonalMatrix<number>::eigenvalue(const size_type i) const
}


/*
template <typename number>
TridiagonalMatrix<number>::
{
}


*/

template class TridiagonalMatrix<float>;
template class TridiagonalMatrix<double>;
Expand Down