Numerical Considerations for the Construction of Karhunen-Loève Expansions

2026-03-19

AI Summary

This study addresses accuracy and consistency issues in the numerical construction of the Karhunen–Loève expansion (KLE) arising from discretization, quadrature rules, and finite sample sizes. It establishes an algebraic equivalence between the spectral decomposition of the Fredholm integral equation and the singular value decomposition (SVD) of a weighted sample covariance matrix, thereby unifying model-driven and data-driven KLE frameworks. The work innovatively constructs the covariance function on a non-simply-connected three-dimensional toroidal domain using the shortest interior path distance, and implements the approach numerically with unstructured meshes and Gaussian quadrature. Experiments demonstrate that, in a one-dimensional benchmark problem, SVD-based eigenvalue estimates and empirical KL coefficients converge to the theoretical 𝒩(0,1) distribution. In two-dimensional irregular and three-dimensional toroidal domains, the study systematically quantifies the combined influence of discretization strategy, quadrature accuracy, and sample size on KLE reconstruction error.

Technology Category

• Machine Learning: Kernel Methods
• Data Mining & Knowledge Management: Data Compression
• Knowledge Representation and Reasoning: Knowledge Engineering

Application Category

• Graph Algorithms and Modeling for the Web: Representation, reconstruction, and subgraph or motif discovery in Web-related graphs
• Semantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semantics
• Search and Retrieval-Augmented AI: Vertical and domain-specific search

Abstract

This report examines numerical aspects of constructing Karhunen-Loève expansions (KLEs) for second-order stochastic processes. The KLE relies on the spectral decomposition of the covariance operator via the Fredholm integral equation of the second kind, which is then discretized on a computational grid, leading to an eigendecomposition task. We derive the algebraic equivalence between this Fredholm-based eigensolution and the singular value decomposition of the weight-scaled sample matrix, yielding consistent solutions for both model-based and data-driven KLE construction. Analytical eigensolutions for exponential and squared-exponential covariance kernels serve as reference benchmarks to assess numerical consistency and accuracy in 1D settings. The convergence of SVD-based eigenvalue estimates and of the empirical distributions of the KL coefficients to their theoretical $\mathcal{N}(0,1)$ target are characterized as a function of sample count. Higher-dimensional configurations include a two-dimensional irregular domain discretized by unstructured triangular meshes with two refinement levels, and a three-dimensional toroidal domain whose non-simply-connected topology motivates a comparison between Euclidean and shortest interior path distances between the grid points. The numerical results highlight the interplay between the discretization strategy, quadrature rule, and sample count, and their impact on the KLE results.

Problem

• Karhunen-Loève expansion
• numerical consistency
• covariance operator
• eigendecomposition
• stochastic processes

Innovation

• Karhunen-Loève expansion
• singular value decomposition
• covariance kernel
• numerical discretization
• stochastic process