44 CEED_QFUNCTION_HELPER void MaxEntry(const CeedScalar *A, CeedInt N, CeedInt *max_idx_row, CeedInt *…  in MaxEntry()  argument
46   *j_max               = max_idx_row[*i_max];  in MaxEntry()
49     CeedInt j = max_idx_row[i];  in MaxEntry()
155 …void ApplyRot(CeedScalar *A, CeedInt N, CeedInt i, CeedInt j, CeedInt *max_idx_row, CeedScalar *ro…  in ApplyRot()  argument
171     if (i == max_idx_row[w]) max_idx_row[w] = MaxEntryRow(A, N, w);  in ApplyRot()
172     else if (fabs(A[w * N + i]) > fabs(A[w * N + max_idx_row[w]])) max_idx_row[w] = i;  in ApplyRot()
184   max_idx_row[i] = MaxEntryRow(A, N, i);  in ApplyRot()
189     if (j == max_idx_row[w]) max_idx_row[w] = MaxEntryRow(A, N, w);  in ApplyRot()
190     else if (fabs(A[w * N + j]) > fabs(A[w * N + max_idx_row[w]])) max_idx_row[w] = j;  in ApplyRot()
194     if (j == max_idx_row[w]) max_idx_row[w] = MaxEntryRow(A, N, w);  in ApplyRot()
195     else if (fabs(A[w * N + j]) > fabs(A[w * N + max_idx_row[w]])) max_idx_row[w] = j;  in ApplyRot()
201   max_idx_row[j] = MaxEntryRow(A, N, j);  in ApplyRot()
277 …Int Diagonalize(CeedScalar *A, CeedInt N, CeedScalar *eval, CeedScalar *evec, CeedInt *max_idx_row,  in Diagonalize()  argument
285   for (CeedInt i = 0; i < N - 1; i++) max_idx_row[i] = MaxEntryRow(A, N, i);  in Diagonalize()
292     MaxEntry(A, N, max_idx_row, &i, &j);  in Diagonalize()
297       max_idx_row[i] = MaxEntryRow(A, N, i);  in Diagonalize()
303     ApplyRot(A, N, i, j, max_idx_row, rotmat_cst);  // Apply this rotation to the A matrix.  in Diagonalize()
319 …Diagonalize3(CeedScalar A[3][3], CeedScalar eval[3], CeedScalar evec[3][3], CeedInt max_idx_row[3],  in Diagonalize3()
321 …(CeedScalar *)A, 3, (CeedScalar *)eval, (CeedScalar *)evec, (CeedInt *)max_idx_row, sort_criteria,…  in Diagonalize3()