“…This approach has two main advantages: first, the resulting memory footprint of the adjoint solver is similar to the primal flow solver, which is largely determined by the system matrix P, while the run-time of the adjoint solver is equivalent to the primal flow solver. Secondly, since the transposed system matrix P T has the same eigenspectra as P, the adjoint solver inherits the convergence rate of the flow solver [50,52,53], which is illustrated in Figure 8 for a radial turbine test case. This is a desirable property as it guarantees convergence of the adjoint problem, provided that primal flow solver converges (i.e., the system matrix at the last iteration of the flow solver is contractive with the magnitude of all eigenvalues less than unity).…”