Skip to content

Commit 3475b36

Browse files
Apply suggestions from code review
Co-authored-by: TobiKattmann <31306376+TobiKattmann@users.noreply.github.com>
1 parent 4eeeb18 commit 3475b36

2 files changed

Lines changed: 6 additions & 6 deletions

File tree

Common/include/linear_algebra/blas_structure.hpp

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -483,12 +483,12 @@ class CBlasStructure {
483483
}
484484

485485
/*!
486-
* \brief Tridiagonal matrix algorithm.
487-
* \param[in] lower diagonal
488-
* \param[in] main diagonal
489-
* \param[in,out] upper diagonal (modified on exit)
486+
* \brief Algorithm to solve a linear system with a tridiagonal matrix.
487+
* \param[in] lower - lower diagonal
488+
* \param[in] main - main diagonal
489+
* \param[in,out] upper - upper diagonal (modified on exit)
490490
* \param[in,out] rhs - right hand side on entry, solution on exit
491-
* \note Same size for all vectors.
491+
* \note Same size for all vectors. Use column index for lower and upper vector.
492492
*/
493493
template<class Vec, class Scalar = su2double>
494494
static void tdma(const Vec& lower, const Vec& main, Vec& upper, Vec& rhs) {

Common/src/toolboxes/C1DInterpolation.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -40,7 +40,7 @@ su2double CAkimaInterpolation::EvaluateSpline(su2double Point_Interp) const {
4040

4141
if (i >= x.size()-1) return (Point_Interp <= x[0])? y.front() : y.back();
4242

43-
su2double h = Point_Interp-x[i];
43+
const su2double h = Point_Interp-x[i];
4444

4545
return y[i]+h*(b[i]+h*(c[i]+h*d[i]));
4646
}

0 commit comments

Comments
 (0)