The algorithm used for the AWE solver follows the description in Section 13.4 of Ref. 16. That presentation, in turn, closely follows the original papers (
Ref. 17 and
Ref. 18). The general form of problems that the AWE solver is intended for is
where n ≥ 1. Apparently, the linear system has to be solved for several right-hand sides. Furthermore, derivatives of
A(
k) and
y(
k) have to be computed. The moments also depend on the choice of
k0, and because expansions likely have to be performed around several points, quite a few solution steps might be needed. Once the moments are available, they can be used to represent each component,
xl(
k), of x(
k)
in terms of a Padé approximations as
where L will be equal to 1, 2, or 3. If
L = 3 and
Q = 6, the
bj can, via manipulations of Equation 19-14 and Equation 19-15, be seen to be the solution to