34 CEED_QFUNCTION_HELPER CeedInt MaxEntryRow(const CeedScalar *A, CeedInt N, CeedInt i) {  in MaxEntryRow()  argument
37     if (fabs(A[i * N + j]) > fabs(A[i * N + j_max])) j_max = j;  in MaxEntryRow()
48 CEED_QFUNCTION_HELPER void MaxEntry(const CeedScalar *A, CeedInt N, CeedInt *max_idx_row, CeedInt *…  in MaxEntry()  argument
51   CeedScalar max_entry = fabs(A[*i_max * N + *j_max]);  in MaxEntry()
54     if (fabs(A[i * N + j]) > max_entry) {  in MaxEntry()
55       max_entry = fabs(A[i * N + j]);  in MaxEntry()
71 CEED_QFUNCTION_HELPER void CalcRot(const CeedScalar *A, CeedInt N, CeedInt i, CeedInt j, CeedScalar…  in CalcRot()  argument
73   CeedScalar A_jj_ii = (A[j * N + j] - A[i * N + i]);  in CalcRot()
78     CeedScalar A_ij  = A[i * N + j];  in CalcRot()
159 CEED_QFUNCTION_HELPER void ApplyRot(CeedScalar *A, CeedInt N, CeedInt i, CeedInt j, CeedInt *max_id…  in ApplyRot()  argument
161   A[i * N + i] -= rotmat_cst[2] * A[i * N + j];  in ApplyRot()
162   A[j * N + j] += rotmat_cst[2] * A[i * N + j];  in ApplyRot()
169   A[i * N + j] = 0.0;  in ApplyRot()
173 …A[i * N + w] = A[w * N + i];                                                 // backup the previou…  in ApplyRot()
174 …A[w * N + i] = rotmat_cst[0] * A[w * N + i] - rotmat_cst[1] * A[w * N + j];  // A[w][i], A[w][j] f…  in ApplyRot()
175     if (i == max_idx_row[w]) max_idx_row[w] = MaxEntryRow(A, N, w);  in ApplyRot()
176     else if (fabs(A[w * N + i]) > fabs(A[w * N + max_idx_row[w]])) max_idx_row[w] = i;  in ApplyRot()
179 …A[w * N + i] = A[i * N + w];                                                 // backup the previou…  in ApplyRot()
180 …A[i * N + w] = rotmat_cst[0] * A[i * N + w] - rotmat_cst[1] * A[w * N + j];  // A[i][w], A[w][j] f…  in ApplyRot()
183 …A[w * N + i] = A[i * N + w];                                                 // backup the previou…  in ApplyRot()
184 …A[i * N + w] = rotmat_cst[0] * A[i * N + w] - rotmat_cst[1] * A[j * N + w];  // A[i][w], A[j][w] f…  in ApplyRot()
188   max_idx_row[i] = MaxEntryRow(A, N, i);  in ApplyRot()
192 …A[w * N + j] = rotmat_cst[1] * A[i * N + w] + rotmat_cst[0] * A[w * N + j];  // A[i][w], A[w][j] f…  in ApplyRot()
193     if (j == max_idx_row[w]) max_idx_row[w] = MaxEntryRow(A, N, w);  in ApplyRot()
194     else if (fabs(A[w * N + j]) > fabs(A[w * N + max_idx_row[w]])) max_idx_row[w] = j;  in ApplyRot()
197 …A[w * N + j] = rotmat_cst[1] * A[w * N + i] + rotmat_cst[0] * A[w * N + j];  // A[w][i], A[w][j] f…  in ApplyRot()
198     if (j == max_idx_row[w]) max_idx_row[w] = MaxEntryRow(A, N, w);  in ApplyRot()
199     else if (fabs(A[w * N + j]) > fabs(A[w * N + max_idx_row[w]])) max_idx_row[w] = j;  in ApplyRot()
202 …A[j * N + w] = rotmat_cst[1] * A[w * N + i] + rotmat_cst[0] * A[j * N + w];  // A[w][i], A[j][w] f…  in ApplyRot()
205   max_idx_row[j] = MaxEntryRow(A, N, j);  in ApplyRot()
218 CEED_QFUNCTION_HELPER void ApplyRotLeft(CeedScalar *A, CeedInt N, CeedInt i, CeedInt j, CeedScalar …  in ApplyRotLeft()  argument
221     CeedScalar Aiv = A[i * N + v];  in ApplyRotLeft()
222     A[i * N + v]   = rotmat_cst[0] * A[i * N + v] - rotmat_cst[1] * A[j * N + v];  in ApplyRotLeft()
223     A[j * N + v]   = rotmat_cst[1] * Aiv + rotmat_cst[0] * A[j * N + v];  in ApplyRotLeft()
281 CEED_QFUNCTION_HELPER CeedInt Diagonalize(CeedScalar *A, CeedInt N, CeedScalar *eval, CeedScalar *e…  in Diagonalize()  argument
289   for (CeedInt i = 0; i < N - 1; i++) max_idx_row[i] = MaxEntryRow(A, N, i);  in Diagonalize()
296     MaxEntry(A, N, max_idx_row, &i, &j);  in Diagonalize()
299 …if ((A[i * N + i] + A[i * N + j] == A[i * N + i]) && (A[j * N + j] + A[i * N + j] == A[j * N + j])…  in Diagonalize()
300       A[i * N + j]   = 0.0;  in Diagonalize()
301       max_idx_row[i] = MaxEntryRow(A, N, i);  in Diagonalize()
304     if (A[i * N + j] == 0.0) break;  in Diagonalize()
306 …CalcRot(A, N, i, j, rotmat_cst);                // Calculate the parameters of the rotation matrix.  in Diagonalize()
307     ApplyRot(A, N, i, j, max_idx_row, rotmat_cst);  // Apply this rotation to the A matrix.  in Diagonalize()
311   for (CeedInt i = 0; i < N; i++) eval[i] = A[i * N + i];  in Diagonalize()
323 CEED_QFUNCTION_HELPER CeedInt Diagonalize3(CeedScalar A[3][3], CeedScalar eval[3], CeedScalar evec[…  in Diagonalize3()
325 …return Diagonalize((CeedScalar *)A, 3, (CeedScalar *)eval, (CeedScalar *)evec, (CeedInt *)max_idx_…  in Diagonalize3()