The goals and contributions of this paper are twofold. It provides a new computational tool for data driven Koopman spectral analysis by taking up the formidable challenge to develop a numerically robust algorithm by following the natural formulation via the Krylov decomposition with the Frobenius companion matrix, and by using its eigenvectors explicitly -these are defined as the inverse of the notoriously ill-conditioned Vandermonde matrix. The key step to curb ill-conditioning is the discrete Fourier transform of the snapshots; in the new representation, the Vandermonde matrix is transformed into a generalized Cauchy matrix, which then allows accurate computation by specially tailored algorithms of numerical linear algebra. The second goal is to shed light on the connection between the formulas for optimal reconstruction weights when reconstructing snapshots using subsets of the computed Koopman modes. It is shown how using a certain weaker form of generalized inverses leads to explicit reconstruction formulas that match the abstract results from Koopman spectral theory, in particular the Generalized Laplace Analysis.AMS subject classifications: 15A12, 15A23, 65F35, 65L05, 65M20, 65M22, 93A15, 93A30, 93B18, 93B40, 93B60, 93C05, 93C10, 93C15, 93C20, 93C57In this paper, we revisit the natural formulation of finite dimensional Koopman spectral analysis in terms of Krylov bases and the Frobenius companion matrix. In this formulation, reviewed in §2.1 below, a spectral approximation of A is obtained by the Rayleigh-Ritz extraction using the primitive Krylov basis X m = (f 1 , . . . , f m ). This means that the Rayleigh quotient of A is the Frobenius companion matrix, whose eigenvector matrix is the inverse of the Vandermonde matrix V m , parametrized by its eigenvalues λ i . The DMD (Koopman) modes, that is, the Ritz vectors z i , are then computed as. . , m. Unfortunately, Vandermonde matrices can have extremely high conditions numbers, so a straightforward implementation of this algebraically elegant scheme can lead to inaccurate results in finite precision computation. Most other DMD-variants bypass this issue by computing an orthonormal basis from the snaphshots using a truncated singular value decomposition [34,33,38]. We note that the original formulation of DMD was based on the SVD ([34], reviewed in Algorithm 2.1 in this paper), whereas the first connection between DMD and Koopman operator theory was formulated in terms of the companion matrix [32]. In Rowley et al. [32], though, there was no consideration of the deep numerical issues related to working with Vandermonde matrices which has likely contributed to the prevalence of the SVD-based variants of DMD. There is, however, a certain intrinsic elegance in the decomposition of the snapshots in terms of the spectral structure of the companion matrix in addition to a stronger connection to Generalized Laplace Analysis (GLA) theory [27,26] of Koopman operator theory than the SVD-based DMD variants have.Following this natural formulation, we present a DMD alg...