Search arXivSearch

arXiv · 2608.06660

CT-PIKAN: Coordinate-Transformed Physics-Informed Kolmogorov-Arnold Network with Autograd-Based Metric Evaluation for Solving PDEs in Curvilinear Domains

Abstract

Physics-Informed Kolmogorov-Arnold Networks have recently emerged as an effective class of neural solvers for partial differential equations, combining the expressive power of spline-based Kolmogorov-Arnold representations with physics-informed learning. However, existing PIKAN formulations are primarily developed for Cartesian domains and cannot naturally accommodate the geometric complexity introduced by curvilinear domains. In this work, we propose Coordinate-Transformed Physics-Informed Kolmogorov-Arnold Networks (CT-PIKAN), a geometry-aware framework for solving PDEs on arbitrarily shaped domains through coordinate transformation. A smooth mapping transforms the physical domain into a regular computational domain, while the transformed governing equations are enforced directly within the physics-informed loss. Unlike conventional transformed PINN approaches that require manually derived metric coefficients, CT-PIKAN employs automatic differentiation to evaluate Jacobians, metric tensors, and transformed differential operators directly from the coordinate mapping, eliminating analytical derivations and improving implementation flexibility. To establish the proposed framework, a data-free B-spline-based PIKAN is first constructed and validated on the two-dimensional advection equation. The CT-PIKAN methodology is subsequently assessed on representative elliptic, parabolic, and hyperbolic benchmark problems, including the Poisson, heat, and advection equations formulated in polar and wavy curvilinear coordinates. The proposed framework provides a general and extensible methodology for integrating differential geometry with physics-informed Kolmogorov-Arnold networks, enabling efficient and accurate PDE solutions on complex domains.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohammad E. Heravifard, Kazem Hejranfar. 2026-08-07. CT-PIKAN: Coordinate-Transformed Physics-Informed Kolmogorov-Arnold Network with Autograd-Based Metric Evaluation for Solving PDEs in Curvilinear Domains. https://arxiv.org/abs/2608.06660

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA