Kernel Principal Component Analysis for Allen–Cahn Equation

preprint OA: closed CC-BY-4.0
🔓 Open OA copy View at publisher

Abstract

Different researchers analyzed effective computational methods that maintain the precision of Allen-Chan (AC) equations and their constant security. This article presents a method known as reduced order model technique by utilizing kernel principle component analysis (KPCA), a nonlinear variation of traditional principal component analysis (PCA). KPCA is utilized on the data matrix created using discrete solution vectors of the AC equation. In order to achieve discrete solutions, small variations are applied for dividing up extraterrestrial elements, while Kahan’s method is used for temporal calculations. Handling the process of backmapping from small-scale space involves utilizing a non-iterative formula rooted in the concept of the multi-dimensional scaling (MDS) method. Using KPCA, we show that simplified sorting methods preserve dissipation of energy structure. The effectiveness of simplified solutions from linear PCA and KPCA, the retention of invariants, and computational speeds are shown through one-, two-, and three-dimensional AC equations.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2024) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-06-04T02:00:05.705006+00:00
License: CC-BY-4.0