WorksPhysics and Astronomy
A Fast Spectral Formulation of the Multiscale Proper Orthogonal Decomposition
Abstract
Multiscale Proper Orthogonal Decomposition (mPOD) decomposes fluid flows into energy-optimal modes within prescribed frequency bands by combining Proper Orthogonal Decomposition with a multiresolution analysis (MRA). In its classical formulation, mPOD relies on a filter bank of finite impulse response (FIR) filters, enabling lossless reconstruction while mitigating Gibbs oscillations and temporal ringing. However, the smooth transition bands required for this purpose introduce partial spectral overlap between adjacent scales and require, for each band, the solution of an eigenvalue problem spanning the full temporal dimension. This work introduces a fast spectral formulation of the mPOD that substantially reduces the computational cost. The proposed approach replaces time-domain FIR filters with compact spectral masks enforcing strictly disjoint frequency supports, thereby exactly decoupling the problem across scales. This leads to a block-diagonal correlation operator in spectral space, so that each band can be treated independently. The resulting eigenvalue problems reduce to small systems whose size depends on the number of active frequencies per band rather than the full time dimension. The approach is validated on a synthetic dataset highlighting spectral windowing effects and on experimental particle image velocimetry (PIV) data of a cylinder wake at Reynolds number \mbox{Re} \approx 5000. In both cases, the proposed formulation accurately recovers the modal structures and singular values of the classical mPOD while reducing the computational cost by orders of magnitude.
Introduction
Data-driven modal decompositions are key tools for identifying coherent structures and interpretable patterns in fluid flow data, enabling diagnostics and reduced-order modeling [1, 2, 3].
A taxonomy of such methods can be organized along a spectrum between two competing objectives: energy optimality, i.e., the ability to capture the largest fraction of the dataset’s variance with a truncated basis, and spectral purity, i.e., the localization of each mode within a prescribed frequency band. At these two extremes sit POD [4, 5, 6] and DMD [7, 8], respectively. The classical trade-off between the two has motivated the development of hybrid decompositions such as the spectral POD proposed by Sieber et al. [9], the frequency-based formulations of the POD by Towne et al. [10], independently referred to as spectral POD, and the multiscale POD (mPOD) by Mendez et al. [11].
Unlike other hybrid decompositions, the mPOD gives the user direct control over this trade-off by explicitly partitioning the frequency axis into prescribed bands and providing an energy-optimal decomposition within each. This yields modes that are simultaneously energy-ranked and spectrally constrained, enabling consistent separation of multiscale and transient dynamics while retaining the convergence properties of classical POD. This flexibility made the mPOD relevant for a wide range of problems, including turbulent motion analysis [12], controlled cylinder wakes [13], transient dynamics [14], jet wiping and gas–liquid coupling instabilities [15], cavitating orifice flows [16], propeller wakes [17], swirled and stratified flames [18], swirling spray flames near lean blowout [19], flow-induced vibration problems [20], compressor corner separation [21], spray characterization [22], sweeping-jet flow control [23] or flows over low-aspect-ratio plates [24] to mention some examples.
The spectral constraints of mPOD were first defined via wavelet-based multiresolution analysis [25] and later reformulated using filter banks [11, 3], as implemented in the open-source toolbox MODULO [26, 27]. In this approach, scale separation is achieved through time-domain FIR filters with smooth transition bands, minimizing spectral leakage and temporal ringing but precluding strict separation between adjacent bands and requiring a full eigenvalue problem per band, sized by the number of temporal snapshots rather than band content. This cost scales steeply with dataset size and dominates the computation for large problems.
Rapid growth in dataset size has spurred efficient implementations of data decomposition methods, including randomized SVD [28], streaming spectral POD [29], and tensor-accelerated DMD variants [30, 31]. In this context, we propose a fast spectral variant of multiscale Proper Orthogonal Decomposition (mPOD) that greatly reduces computational cost.
Our approach departs from the classical formulation by strictly separating spectral supports. While the idea of tackling the eigenvalue problem in the frequency domain can be traced back to the early spectral formulations of the POD [32, 33], the present compact formulation, restricted to non-zero spectral content, is, to the authors’ knowledge, the first systematic framework for multiscale decomposition of this kind.
The remainder of this paper is organized as follows. Section2 briefly recalls the classical formulation of the mPOD and highlights its computational bottlenecks. Section 3 introduces the proposed spectral formulation, detailing the construction of the compact operators and the resulting fast algorithm, proposed in two variants. Section 4 verifies the approach on both synthetic and experimental datasets and assesses its computational performance compared to the classical mPOD. Finally, concluding remarks and perspectives are provided in Section 5.
The classical Multiscale POD (mPOD)
We denote the snapshot matrix collecting temporal realizations of a spatial field sampled at spatial locations. The mPOD proceeds in three steps: (i) the snapshot matrix is partitioned into scale-specific contributions using a predefined filter bank, (ii) a POD is performed on each scale independently, and (iii) the resulting modes are assembled into a single global factorization. This yields a decomposition of the form
where denotes transposition, contains the temporal modes associated with scale , the corresponding spatial modes, and is a diagonal matrix of singular values. The temporal basis of the mPOD is obtained by concatenating the temporal structures from all scales,
where . The associated spatial structures and amplitudes are then obtained by projection and normalization, as in the standard snapshot POD [5] (see also Mendez [3]).
The partition of the snapshot matrix into scale contributions defines a multi-resolution analysis of the snapshot matrix (see [34]). Each scale is identified by a temporal filter. In the time domain, the filtering corresponds to a convolution along the temporal direction,
where collects the impulse responses of the filter associated with scale (see [3]).
Equivalently, filtering can be performed in the frequency domain. Denoting by the discrete Fourier matrix for the temporal direction, such that the temporal Fourier coefficients of the data read , with denoting a complex conjugation of , and denoting by the diagonal matrix collecting the transfer function of the filter associated with scale , the scale contribution reads
In (3) and in the following, matrix multiplications involving and are only formal—in practice, these operations correspond to inverse and forward discrete Fourier transforms implemented using fft and ifft routines.
Assuming perfect spectral separation between filters, that is,
each frequency is assigned to a single scale.
Therefore, each matrix has rank , where denotes the number of Fourier coefficients retained in the -th scale. For real-valued data, Fourier coefficients occur in complex-conjugate pairs, so the number of independent degrees of freedom is generally smaller than .
If (4) holds, the temporal modes belonging to different scales are mutually orthogonal and forms an orthonormal temporal basis—the factorization (1) is a summation of Singular Value Decompositions (SVDs) of the filtered blocks. Accordingly, the spatial modes are orthonormal within each scale by construction of the SVD, but are not, in general, orthogonal across different scales.
In practice, preserving the orthogonality of the temporal basis requires additional processing. The assumption of perfect spectral separation is not enforced because filters with excessively sharp transfer functions would produce long impulse responses and spurious oscillations in the time domain. For this reason, practical filter banks employ smooth transition bands, which lead to partial spectral overlap between neighboring filters. To restore orthogonality, the traditional mPOD algorithm uses a QR factorization , to polish the assembled temporal basis, i.e. replacing .
Case – temporal correlation approach
When the number of temporal samples is much smaller than the number of spatial degrees of freedom, it is convenient to construct the decomposition from the temporal correlation matrix , where denotes the Hermitian transpose. This leads to eigenvalue problems of size .
The multiscale decomposition is obtained by neglecting cross terms between scales (which should equal zero in case of perfect spectral separation). That is
Introducing (3), one obtains
assuming real-valued transfer functions (corresponding to noncausal, zero-phase filtering), and having introduced the spectral representation of the temporal correlation matrix
and its filtered version .
These spectral representations correspond to applying the discrete Fourier transform along both temporal indices of the correlation matrix (see [11]).
The temporal structures are eigenvectors of the covariance matrix at each scale, that is
Algorithm 1 summarizes the classic mPOD algorithm proposed in [11]. To set the stage for the proposed spectral implementation, it is worth noticing that the definition in (7) leads to a similarity transform and hence the eigenvalue problem (8) can be related to the eigenvalue problem for [3]:
where is the Fourier representation of the temporal modes. The modes in physical space are recovered via
Equations (9) and (10) could be used instead of (8) in line 6 of Algorithm 1. However, since both involve diagonalization of matrices of size , there are currently no benefits in operating in the spectral domain.
| Algorithm 1 Classical mPOD via temporal-correlation |
| 1: Input: data matrix , frequency splitting vector |
| 2: Construct the filter bank from |
| 3: Compute temporal correlation matrix |
| 4: for do |
| 5: Compute filtered correlation matrix |
| 6: Solve eigenvalue problem |
| 7: end for |
| 8: Assemble temporal basis |
| 9: Enforce orthonormality |
| 10: Compute spatial modes |
Table 1.
The computational cost is dominated by two operations: the construction of the temporal correlation matrix , which requires operations, and the repeated solution of the eigenvalue problems of size , which requires per scale. Therefore, the overall complexity is
Case – spatial correlation approach
When the number of spatial degrees of freedom is much smaller than the number of temporal samples, it is more convenient to construct the decomposition directly from the matrices in (3) through their singular value decomposition. This can be computed by diagonalizing the spatial correlation matrices , which leads to eigenvalue problems of size . An efficient spectral formulation to this approach, not presented in [11], is detailed below.
Introducing (3), one obtains
(12) shows that the spatial correlation matrix at scale can be assembled directly in the spectral domain, without explicitly forming the filtered signal in the time domain. Once the eigenvalue problem
has been solved, the temporal modes can be recovered from the filtered spectral data through
Algorithm 2 summarizes the corresponding mPOD implementation.
| Algorithm 2 Classical mPOD via spatial correlation |
| 1: Input: data matrix , frequency splitting vector |
| 2: Construct the filter bank from |
| 3: Compute the Fourier-transformed data matrix |
| 4: for do |
| 5: Filter the data and get |
| 6: Compute the spatial correlation matrix |
| 7: Solve eigenvalue problem |
| 8: Compute spectra |
| 9: Recover temporal modes |
| 10: end for |
| 11: Assemble temporal basis |
| 12: Enforce orthonormality |
| 13: Compute spatial modes |
Table 2.
The computational cost of this formulation is dominated by three operations: the Fourier transform of the data matrix, which is , the construction of the filtered spatial correlation matrices, which is for each frequency band, and the repeated solution of the eigenvalue problems of size , which is . The total complexity of this approach is thus
The fast (spectral) mPOD
The classical mPOD employs smooth transfer functions designed to approximate a partition of unity while limiting Gibbs oscillations and temporal ringing. However, the resulting overlap between neighboring bands prevents strictly compact spectral support, so the matrices and are not exactly low-rank, even if most of their energy is concentrated in a subspace of dimension close to .
In the present work, we deliberately adopt the opposite design philosophy in order to unlock major computational gains for large datasets. Instead of constructing time-domain FIR filters, we define compact spectral masks directly in the frequency domain, enforcing strictly disjoint spectral supports while relaxing the partition-of-unity condition.
Let denote the frequency splitting vector defining the spectral bands. For each band , the mask is constructed to be unity within the core of the interval and to smoothly taper to zero near the band boundaries. The tapering is implemented through cosine windows of width placed inside the nominal band, so that for and , while smoothly reaching unity within the band interior.
Because the transition regions are contained within each band rather than extending across adjacent bands, neighboring masks share exact zero crossings at the splitting frequencies. Therefore, , if , and the filtered matrices and contain at most active spectral components. Hence, , . This compact-support property enables a reformulation of the mPOD in which each scale can be treated independently on a reduced spectral subspace. The structure of this reduction is made explicit by examining the sparsity patterns of the filtered spectral data matrices and their associated correlation matrices .
Sparsity patterns and compact structures
The sparsity patterns in and depend on the position of the passband within the spectrum and fall into three canonical configurations. Since and are real-valued, their Fourier representations are conjugate symmetric with respect to positive and negative frequencies. As a result, the spectral blocks associated with opposite frequency intervals are not independent, but related by complex conjugation (up to a possible permutation of the frequency ordering).
For the first scale, corresponding to the low-frequency contribution, only the coefficients in a neighborhood of zero frequency are retained. In a frequency ordering centred around , the filtered spectral data matrix takes the form
where collects the active low-frequency coefficients and the zero blocks represent frequency intervals where the spectral mask vanishes. The size of these blocks is determined by the bandwidth of the active region, so that each matrix contains at most nonzero columns (up to possible degeneracies in the data) corresponding to the retained frequencies, while the remaining columns are identically zero.
The corresponding filtered spectral correlation matrix is
with the compact version of the large scale contribution.
For an intermediate scale , corresponding to a band-pass contribution, the retained coefficients occupy two symmetric intervals around the zero frequency. The filtered spectral data matrix takes the form
where and correspond to the negative- and positive-frequency contributions, respectively, and satisfy
The filtered spectral correlation matrix then has the structure
with
the compact version. Moreover, because of the conjugate symmetry of the Fourier coefficients of real-valued signals, the diagonal blocks and are themselves related by complex conjugation, up to a possible permutation induced by frequency ordering. Finally, for the last scale, corresponding to the high-pass contribution, the retained coefficients occupy the outer portions of the spectrum. The filtered spectral data matrix takes the form
where and denote the negative- and positive-frequency contributions, respectively, and satisfy
The filtered spectral correlation matrix is
with
recalling that the conjugate symmetry of the Fourier coefficients of real-valued signals ensures that the diagonal blocks and are related by complex conjugation, up to a permutation induced by frequency ordering.
Fast mPOD algorithms and computational cost
The compact-support structure described above enables the construction of the mPOD through reduced eigenvalue problems. In practice, this requires assembling the bandwise spectral correlation matrices , which can be achieved through two alternative implementation routes.
In the first route, one follows the method-of-snapshots philosophy and works from the temporal correlation matrix . The matrix is transformed into the spectral domain to obtain , after which the mask is applied to extract the contribution of the -th band. This route is natural when , since the correlation matrix is then much smaller than the data matrix.
In the second route, one first transforms the data matrix into the spectral domain, obtaining , and then applies the mask directly to the Fourier coefficients of the data. The filtered spectral correlation matrix is then assembled as . This route avoids the construction of the full matrix and becomes advantageous when the spectral bands are narrow, i.e. when , since all operations are restricted to the reduced spectral subspaces associated with the active frequencies.
The two implementations are equivalent in the ideal compact-support setting, because the spectral masks enforce strictly disjoint frequency supports, so that no cross-band interactions are present and the filtering operation commutes with the construction of the correlation matrix. The overall procedure is summarized in Algorithm 3, while the two implementations of ComputeBandMatrix are detailed in Algorithm 4.
Importantly, the eigenvalue problem is not solved on the full matrix , but only on its compact nonzero blocks introduced in the previous subsection. This reduction is justified by the block-structured results in Appendix Appendix A, which show that the nonzero eigenvalues and eigenvectors of are entirely determined by those of its compact block. Therefore, each scale leads to an independent eigenvalue problem whose size is determined solely by the number of active frequencies , rather than the full temporal dimension .
Algorithm 3 Fast spectral mPOD
Input: data matrix , frequency splitting vector
Construct the spectral masks from .
for do
Compute
Extract compact block
Solve reduced eigenvalue problem
Recover temporal modes
end for
Assemble temporal basis
Compute spatial modes
The computational cost of the fast mPOD formulation is dominated by the construction of bandwise spectral matrices and by the reduced eigendecompositions. In all cases, extracting compact blocks from is negligible compared to the matrix products and eigensolves.
Algorithm 4 ComputeBandMatrix()
Input: data matrix , mask of scale
if then
Compute temporal correlation matrix
Compute spectral representation
Return
else
Compute Fourier-transformed data
Extract filtered spectral data block
Return
end if
For the correlation-based route (lines 4–6 in Algorithm 4), the dominant steps are the construction of the temporal correlation matrix, with cost , the spectral transformation of , with cost , and the reduced eigendecompositions, with total cost . The total complexity is therefore
For the data-based route (lines 8–10 in Algorithm 4), the Fourier transform of the data matrix costs , while the construction of the bandwise matrices , which costs . Adding the reduced eigendecompositions gives the total complexity
A similar acceleration can be applied to the spatial-correlation formulation based on . In this case, the compact-support structure allows one to compute so that only the active spectral coefficients are involved. This reduces the cost of assembling from to per band. However, the size of the associated eigenvalue problems remains , so that the overall computational gain is less pronounced than in the temporal-correlation formulation.
Verification and Performance Assessment
This section verifies that the proposed formulation reproduces the results of the classical mPOD while significantly reducing computational cost. Section 4.1 compares the scale-separation obtained with the classical FIR-based filters and the proposed spectral-mask formulation using a synthetic test case. Section 4.2 demonstrates the performance of the method on a canonical fluid-dynamics dataset consisting of the wake of a circular cylinder at Reynolds number . Finally, Section 4.3 analyzes the computational scaling of the proposed algorithm and compares it with the classical mPOD implementation.
Synthetic test: FIR filters vs spectral masks
This test compares the mask-based fast mPOD approach to the classical FIR filter-based approach on an artificial dataset. The test has three main objectives: (i) to compare the shapes of the individual masks with the amplitudes of the FIR filter responses , (ii) to evaluate the reconstruction properties of the masks and filters, i.e. and , and (iii) to assess their performance in mitigating the Gibbs phenomenon. For this last objective, three approaches are compared: (i) the FIR filter-based formulation as in Algorithm 1, (ii) the mask-based approach as in Algorithm 3, and (iii) a variant of the mask-based approach with infinitely sharp band boundaries.
The test is based on the mPOD analysis of an artificial dataset with , which was constructed to pose a challenging problem for Fourier-based approaches, thereby promoting the appearance of the Gibbs phenomenon. The temporal evolution shapes used to create the test data are shown in Figure 1, with the sine waves superimposed on the slopes having frequencies of and , respectively. The mPOD analysis was performed using the frequency splitting vector with the taper region size set to for all scales and the FIR filter order set to 1001 for all scales.
Figure 1. Temporal functions used to assemble the test dataset. Test mode 1 () is nonzero only in the range temporal indices with the slope defined as and the superimposed sine wave with . Test mode 2 () is nonzero only in the range temporal indices with the slope defined as and the superimposed sine wave with . The third test mode () is a single wavelet in the interval .
As shown in Figure 2, the mask exhibits a taper shape similar to that of the FIR filter amplitude. However, unlike the FIR filters, the taper of the mask is entirely confined within the corresponding frequency band, as described in Section 3. This ensures perfect spectral separation, but at the expense of the reconstruction property, as illustrated in Figure 3.
Figure 2. Mask and the magnitude of the low-pass FIR filter frequency response of the first frequency band.
Figure 3. Reconstruction property of the masks and FIR filters. The drops in the mask-based approach around the frequency block boundaries due to the combination of smooth taper and disjoint spectral supports of the masks are clearly visible.
The impact of this trade-off on the Gibbs phenomenon is illustrated in Figure 4. The mask-based approach exhibits localized oscillations near temporal discontinuities, which are slightly more pronounced than in the FIR-based formulation due to the absence of spectral overlap. However, these oscillations remain significantly smaller than those obtained with sharp spectral truncation, demonstrating that the smooth tapering within each band effectively mitigates spurious ringing
Figure 4. mPOD modes from the decomposition of the artificial dataset to showcase the Gibbs phenomenon. All 5 significant modes together with the relevant details are shown. The figure is structured as follows: (a) Mode 1, (b) Mode 2, (c) Mode 3, (d) Mode 4, and (e) Mode 5. The frequency split of the mPOD allowed for isolation of the sine waves while retaining the temporal localization of those waves.
while preserving strict spectral separation.
A classic experimental benchmark
The experimental dataset used in this study is taken from [35], where the canonical case of a cylinder in crossflow is investigated using time-resolved particle image velocimetry (TR-PIV). This configuration, being one of the standard benchmarks in fluid dynamics, is adopted here to assess the performance of the proposed method. For a complete description of the experimental setup and measurement procedure, the reader is referred to [35].
Measurements were conducted in a wind tunnel with a closed test section of a cross-section. The freestream velocity was and the cylinder diameter was , yielding a Reynolds number and a fundamental vortex shedding frequency of . The experiments were performed in air at ambient conditions (, ), with the cylinder oriented transversely to the flow and spanning the entire test section.
The velocity fields were acquired in a plane normal to the cylinder axis using TR-PIV with a sampling frequency of kHz. The region of interest has a spatial resolution of and points in the and directions, respectively, with two velocity components per point, resulting in a total spatial dimension of . A total of 2 seconds of data were recorded, corresponding to snapshots.
The mPOD processing was based on the frequency splitting vector Hz, with the last scale (above 245 Hz) being discarded. This places the band boundaries between successive harmonic frequencies. The FIR filter order for the classical mPOD was set to 501 for all scales, while the taper width for the fast mPOD was set to Hz. In all cases, the algorithm was configured to extract the 10 most energetic modes. Figure 5 presents the spatial structures and corresponding spectra of the modes associated with the first, second, and third harmonic frequencies.

Figure 5. mPOD modes corresponding to first (a, b), second (c, d), and third (e, f) harmonic frequency, (a, c, e) magnitude with line integral convolution (LIC) streamlines for visualizing the flow patterns, (b, d, f) corresponding mode spectra
Figure 6 shows the absolute differences between the classical and fast mPOD results, displayed on a logarithmic color scale. Overall, the fast mPOD accurately reproduces the spatial structures obtained with the classical formulation, with relative differences on the order of a few percent. These discrepancies are predominantly confined to regions of low fluctuation intensity, where the flow does not exhibit coherent structures and the modal amplitudes are small.

Figure 6. Absolute differences between FIR implementation and fast mPOD modes. Modes correspond to (a) first, (b) second, (c) third harmonic frequency.
In contrast, the dominant coherent structures associated with the vortex shedding are recovered almost identically. This indicates that the proposed formulation preserves the relevant content of the decomposition, while the observed differences mainly affect low-energy components. The remaining discrepancies can be attributed to two closely related factors: (i) the absence of spectral overlap between adjacent bands in the fast formulation, and (ii) the QR orthogonalization step in the classical mPOD, which slightly modifies the temporal modes to enforce orthogonality, with a corresponding propagation to the spatial modes.
Figure 7 compares the convergence behavior of the different decompositions in terms of singular value decay. The results show that mPOD retains the rapid convergence characteristics of POD while enforcing spectral separation across scales. In particular, the decay of the modal amplitudes closely follows that of POD, indicating that the energy-optimality of the decomposition is largely preserved within each band. By contrast, the DFT exhibits a much slower decay, as expected from its purely frequency-based nature, which does not provide an optimal energy ranking of the modes. This results highlights the ability of mPOD to combine spectral localization with efficient energy capture, even in flows with strongly periodic dynamics.
Figure 7. Convergence of different data decomposition methods on the cylinder-in-crossflow dataset.
Computational complexity and scaling
Computational complexity was assessed on synthetic test cases using random data matrices and a uniform frequency partition. The dependence of computation time on the number of temporal snapshots was analyzed for four configurations, obtained by combining two spatial dimensions, and , with two numbers of frequency bands, and . The bands were uniformly distributed over the frequency range, yielding for all . For each configuration, the number of snapshots was varied in the range . The results shown in Figure 8 correspond to averages over four realizations, computed using the MODULО toolbox (version 2.1.6) on Intel Xeon Gold 3.0 GHz processors using 12 cores.
Figure 8. Computation times for (a) and (b) . Approaches according to Algorithm 1, correlation-based version of Algorithm 3, and data-based version of Algorithm 3 are compared. In both (a) and (b), it can be seen that the correlation-based approach is good for slender data matrices, while the data-based approach is best suited for short and fat data matrices.
As shown in Figure 8, the fast mPOD achieves speedups of up to two orders of magnitude compared to the classical formulation. Moreover, a distinctive scaling behavior of the fast mPOD is observed: the computational cost decreases as the number of frequency bands increases. This behavior follows directly from the reduced eigenvalue problems, whose dimensions scale as . Substituting this relation into the complexity estimates in equations 26 and 27 yields contributions proportional to and , respectively.
This trend contrasts with the classical mPOD, whose computational cost increases linearly with , as shown in equation 11. Therefore, while increasing the number of scales typically leads to higher costs in the classical formulation, it instead results in cheaper computations in the fast formulation due to the progressive reduction of the spectral subspaces.
Finally, comparing the two implementations of the fast mPOD shows that the correlation-based approach is most efficient for tall matrices (), whereas the data-based approach performs best for short, wide matrices. This behavior is consistent with the theoretical complexity estimates and reflects the different matrix dimensions involved in each formulation.
Conclusion
This work revisits the multiscale Proper Orthogonal Decomposition (mPOD) with a focus on its computational complexity and the identification of its main bottlenecks. In the classical formulation based on FIR filters, the scale correlation matrices concentrate their energy within prescribed frequency bands but are not strictly low-rank, which necessitates solving full-order eigenvalue problems at each scale.
To overcome this limitation, we introduced a fast spectral formulation of the mPOD based on masks with compact spectral support. By enforcing strictly disjoint frequency bands, the proposed approach yields scale-specific correlation matrices that are exactly low-rank and admits a block structure that allows the eigenvalue problems to be solved in reduced spectral subspaces. This results in a significant reduction of the computational cost.
The method was assessed on both synthetic and experimental datasets. The synthetic test case highlighted the trade-off between spectral separation and Gibbs mitigation: while the fast mPOD exhibits slightly stronger oscillations than the FIR-based formulation, it remains far superior to sharp spectral truncation. The experimental test on a cylinder wake at Reynolds demonstrated that the fast mPOD accurately reproduces the spatial structures and spectral content of the classical formulation, with only minor differences confined to lowenergy regions. Finally, the computational complexity study confirmed the theoretical scaling predictions and showed that the proposed method achieves speedups of up to two orders of magnitude for the investigated dataset. Overall, the results demonstrate that the fast mPOD preserves the interpretability and convergence properties of the classical formulation while drastically reducing computational cost. This opens the way to efficient multiscale analysis of large-scale datasets.
Acknowledgments
This work was carried out as part of the Short Training Program (STP) of Marek Belda at the von Karman Institute. Marek Belda acknowledges the institutional support RVO:61388998 and the financial support provided by the Grant Agency of the Czech Technical University in Prague, grant No. SGS25/127/OHK2/3T/12. Martin Isoz acknowledges the financial support provided by the Ministry of Education, Youth, and Sports of the Czech Republic via the project No. CZ.02.01.01/00/23_020/0008501 (METEX), co-funded by the European Union. M. A. Mendez is supported by the European Research Council (ERC, grant agreement No 101165479 RE-TWIST StG). Views and opinions expressed are however those of the authors only and do not necessarily reflect those of the European Union or the European Research Council. Neither the European Union nor the granting authority can be held responsible for them. L. Schena is supported by Fonds Wetenschappelijk Onderzoek (FWO), Proj. Number 1S67925N.
Results for block-structured matrices
This appendix collects the algebraic results used in Section 3 to justify the reduction of eigenvalue problems associated with block-sparse spectral correlation matrices.
Theorem A1. Let
where the nonzero blocks do not overlap and are arranged so that
is well defined. Then the nonzero eigenvalues of coincide with the eigenvalues of .
Proof. The characteristic polynomial of factorizes as
obtained by expanding the determinant along the zero-padded rows and columns. Hence, the spectrum of consists of the spectrum of together with additional zero eigenvalues. □
Theorem A2. Let be an eigenvalue of in (A.1), with associated eigenvector
Then , and the nonzero part of is obtained from the eigenvector
of associated with the same eigenvalue .
Proof. From , the rows corresponding to the zero blocks give
Since , it follows that
The remaining equations reduce to
so is an eigenvector of , and is recovered by zero-padding. □
Theorem A3. Let be two block-structured matrices of the form (A.1), with nonzero blocks supported on disjoint sets of rows and columns. Define
Then:
every nonzero eigenpair of or is also an eigenpair of ;
the nonzero spectrum of is the union of the nonzero spectra of and .
Proof. Let be a nonzero eigenpair of . By Theorem A2, the support of is confined to the rows and columns occupied by the nonzero blocks of . Since is supported on a disjoint set of rows and columns, one has . Therefore
The same argument holds for eigenpairs of . Since the supports are disjoint, the nonzero invariant subspaces do not interact, and the nonzero spectrum of is exactly the union of the nonzero spectra of and . □
References
- [1]K. Taira, S. L. Brunton, S. T. M. Dawson, C. W. Rowley, T. Colonius, B. J. McKeon, O. T. Schmidt, S. Gordeyev, V. Theofilis, L. S. Ukeiley, Modal analysis of fluid flows: An overview, AIAA Journal 55 (2017) 4013–4041. doi:10.2514/1.j056060.DOI
- [2]B. Begiashvili, N. Groun, J. Garicano-Mena, S. Le Clainche, E. Valero, Data-driven modal decomposition methods as feature detection techniques for flow problems: A critical assessment, Physics of Fluids 35 (2023). doi:10.1063/5.0142102.DOI
- [3]M. Mendez, Generalized and Multiscale Modal Analysis, Cambridge University Press, 2023, p. 153–181.arxiv.org/abs/2208.12630
- [4]J. L. Lumley, Stochastic Tools in Turbulence, DOVER PUBN INC, 1970.
- [5]L. Sirovich, Turbulence and the dynamics of coherent structures, part III: Dynamics and scaling, Quarterly of Applied Mathematics 45 (1987) 583–590.DOI
- [6]S. Dawson, The Proper Orthogonal Decomposition, Cambridge University Press, 2023, p. 117–132.DOI
- [7]P. J. Schmid, Dynamic mode decomposition of numerical and experimental data, Journal of Fluid Mechanics 656 (2010) 5–28. doi:10.1017/S00221120100001217.
- [8]J. H. Tu, C. W. Rowley, D. M. Luchtenburg, S. L. Brunton, J. N. Kutz, On dynamic mode decomposition: theory and applications, Journal of Computational Dynamics 1 (2014) 391–421. doi:10.3934/jcd.2014.1.391.DOI
- [9]M. Sieber, C. O. Paschereit, K. Oberleithner, Spectral proper orthogonal decomposition, Journal of Fluid Mechanics 792 (2016) 798–828. doi:10.1017/jfm.2016.103.DOI
- [10]A. Towne, O. T. Schmidt, T. Colonius, Spectral proper orthogonal decomposition and its relationship to dynamic mode decomposition and resolvent analysis, Journal of Fluid Mechanics 847 (2018) 821–867. doi:10.1017/jfm.2018.283.DOI
- [11]M. A. Mendez, M. Balabane, J.-M. Buchlin, Multi-scale proper orthogonal decomposition of complex fluid flows, Journal of Fluid Mechanics 870 (2019) 988–1036. doi:10.1017/jfm.2019.212.DOI
- [12]C. Chi, D. Thévenin, A. J. Smits, S. Wolligandt, H. Theisel, Identification and analysis of very-large-scale turbulent motions using multiscale proper orthogonal decomposition, Phys. Rev. Fluids 7 (2022) 084603. doi:10.1103/PhysRevFluids.7.084603.DOI
- [13]Y. Zhong, H. Ma, J. Guo, Multi-scale proper orthogonal decomposition (mpod) analysis of vortex evolution and viscous dissipation in a circular-cylinder wake controlled by parallel symmetric jets, Ocean Engineering 289 (2023) 116280. doi:10.1016/j.oceaneng.2023.116280.DOI
- [14]M. A. Mendez, D. Hess, B. B. Watz, J.-M. Buchlin, Multiscale proper orthogonal decomposition (mpod) of tr-piv data—a case study on stationary and transient cylinder wake flows, Measurement Science and Technology 31 (2020) 094014. doi:10.1088/1361-6501/ab82be.DOI
- [15]D. Barreiro-Villaverde, A. Gosset, M. Lema, M. A. Mendez, On the coupling instability of a gas jet impinging on a liquid film, Journal of Fluid Mechanics 992 (2024) A11. URL: https://www.cambridge.org/core/product/identifier/S0022112024005536/type/journal_article. doi:10.1017/jfm.2024.553.
- [16]C. Esposito, M. Mendez, J. Steelant, M. Vetrano, Spectral and modal analysis of a cavitating flow through an orifice, Experimental Thermal and Fluid Science 121 (2021) 110251. doi:10.1016/j.expthermflusci.2020.110251.DOI
- [17]H. Huang, M. Li, L. Wang, Study on the propeller wake dynamics using multiscale proper orthogonal decomposition, Physics of Fluids 37 (2025). doi:10.1063/5.0243607.DOI
- [18]A. Procacci, M. M. Kamal, M. A. Mendez, S. Hochgreb, A. Coussemient, A. Parente, Multi-scale proper orthogonal decomposition analysis of instabilities in swirled and stratified flames, Physics of Fluids 34 (2022). doi:10.1063/5.0127956.
- [19]M. G. De Giorgi, P. Di Gloria, D. Fontanarosa, A. Ficarella, Advanced multiscale model and frequency analysis of swirling spray flame near to lean blowout, Case Studies in Thermal Engineering 60 (2024) 104651. doi:10.1016/j.csite.2024.104651.DOI
- [20]M. J. Janocha, M. C. Ong, G. Yin, Large eddy simulations and modal decomposition analysis of flow past a cylinder subject to flow-induced vibration, Physics of Fluids 34 (2022). doi:10.1063/5.0084966.DOI
- [21]Y. Liu, W. Zhong, Y. Tang, Impact of dominant flow structures on turbulence energy in compressor corner separation, AIAA Journal 63 (2025) 5355–5370. doi:10.2514/1.J065420.DOI
- [22]R. Zhou, C. Shen, Experimental study on the spray characteristics of a pintle injector element, Acta Astronautica 194 (2022) 255–262. doi:10.1016/j.actaastro.2022.02.019.DOI
- [23]P. Wang, J. Song, J. Cai, Y. Liu, X. Wen, Transient evolution of flow structures induced by sweeping jets on a circular cylinder via multi-scale proper orthogonal decomposition (mpod), Aerospace Science and Technology 168 (2026) 111341. doi:10.1016/j.ast.2025.111341.
- [24]Y. Zhu, J. Liu, J. Wang, Reversal of nonlinear energy transfer direction in flows over low-aspect-ratio plates, Journal of Fluid Mechanics 1010 (2025). doi:10.1017/jfm.2025.228.DOI
- [25]M. Mendez, M. Scelzo, J.-M. Buchlin, Multiscale modal analysis of an oscillating impinging gas jet, Experimental Thermal and Fluid Science 91 (2018) 256–276. doi:10.1016/j.expthermflusci.2017.10.032.DOI
- [26]D. Ninni, M. A. Mendez, Modulo: A software for multiscale proper orthogonal decomposition of data, SoftwareX 12 (2020) 100622. doi:10.1016/j.softx.2020.100622.DOI
- [27]R. Poletti, L. Schena, D. Ninni, M. A. Mendez, Modulo: A python toolbox for data-driven modal decomposition, Journal of Open Source Software 9 (2024) 6753. doi:10.21105/joss.06753.DOI
- [28]D. Palitta, S. Portaro, Row-aware randomized svd with applications, 2025. URL: https://arxiv.org/abs/2408.04503. doi:10.48550/arXiv.2408.04503. arXiv:2408.04503.
- [29]O. T. Schmidt, A. Towne, An efficient streaming algorithm for spectral proper orthogonal decomposition, Computer Physics Communications 237 (2019) 98–109. doi:10.1016/j.cpc.2018.11.009.DOI
- [30]K. Li, S. Utyuzhnikov, Tensor train-based higher-order dynamic mode decomposition for dynamical systems, Mathematics (2023). doi:10.3390/math11081809.DOI
- [31]Z. He, M. Hu, Y. Lou, C. Chen, Tensor dynamic mode decomposition, 2025. URL: https://arxiv.org/abs/2508.02627. doi:10.48550/arXiv.2508.02627. arXiv:2508.02627.
- [32]W. K. George, Insight into the dynamics of coherent structures from a proper orthogonal decomposition, in: Proceedings of the International Centre for Heat and Mass Transfer, 1988, p. 469 – 487.
- [33]M. N. Glauser, S. J. Leib, W. K. George, Coherent structures in the axisymmetric turbulent jet mixing layer, in: F. Durst, B. E. Launder, J. L. Lumley, F. W. Schmidt, J. H. Whitelaw (Eds.), Turbulent Shear Flows 5, Springer Berlin Heidelberg, Berlin, Heidelberg, 1987, pp. 134–145.DOI
- [34]G. Strang, T. Nguyen, Wavelets and filter banks, rev. ed. ed., Wellesley-Cambridge Press, Wellesley, Mass., 1997. Literaturverz. S. [475] - 486.
- [35]T. Hlavatý, M. Isoz, M. Belda, V. Uruba, P. Procházka, Is the proper orthogonal decomposition suitable to validate simulation of turbulent wake?, Journal of Wind Engineering and Industrial Aerodynamics 255 (2024) 105953.DOI





