alphaFeedback

WorksMathematics

A Physics-Informed Neural Network for Geodesic Computation and Visualization of Geodesic Spheres on Riemannian Manifolds

AI contributions
Not recorded for this paper
View details
Ancillary data
1 code link
View

Abstract

Visualizing geodesic structures associated with general Riemannian metrics is a challenging problem in computational differential geometry. In this work, we present a computational framework for visualizing geodesics and geodesic spheres on a three-dimensional Riemannian manifold equipped with the metric g=diag(1,x2,1),x>0g=\text{diag}(1,x^2,1), x>0. The associated Christoffel symbols and curvature tensors are computed symbolically, and the resulting geodesic equations are solved using both SciPy's numerical integration method and a Physics-Informed Neural Network (PINN). The two solutions are compared to assess the accuracy of the neural network approximation. We further develop geodesic spike diagrams and surface visualizations to illustrate the deformation of geodesic spheres relative to their Euclidean counterparts. Intrinsic Riemannian surface area and volume are estimated numerically using the induced metric and the Riemannian volume density, respectively. For the chosen metric and a geodesic ball of radius one, the computed area and volume are approximately 0.362%0.362\% and 0.364%0.364\% smaller than the corresponding Euclidean values at the base grid resolution. A grid-refinement study is also performed to examine the sensitivity of these estimates to numerical resolution. The proposed framework demonstrates how symbolic differential geometry, numerical integration, and PINNs can be combined to investigate and visualize geometric structures associated with Riemannian metrics.

Introduction

Statement of the problem

Imagination comes when one visualize something and then extends it in mind. Visualization plays a very important role in mathematics and specially in geometry. Objects that appear in Euclidean geometry are easy to visualize. Any function f:R→Rf:\mathbb{R}\to\mathbb{R} can be plotted as a subset G(f)={(x,f(x)):x∈R}⊂R2G(f)=\{(x,f(x)):x\in\mathbb{R}\}\subset\mathbb{R}^{2}. In similar fashion a map f:R2→Rf:\mathbb{R}^{2}\to\mathbb{R} can be visualized using the graph G(f)={(x,y,f(x,y)):(x,y)∈R2}⊂R3G(f)=\{(x,y,f(x,y)):(x,y)\in\mathbb{R}^{2}\}\subset\mathbb{R}^{3}. Things gets interesting when dimension reaches to 4. For example, a map f:R3→Rf:\mathbb{R}^{3}\to\mathbb{R} or f:R2→R2f:\mathbb{R}^{2}\to\mathbb{R}^{2} can produce a graph G(f)G(f) as a subset of R4\mathbb{R}^{4}. We have no direct access to the 4 dimensional space and hence they can not be visualized in the traditional manner. Another obstacle is the metric defined on the space. For example, we are able to plot those graphs on R2\mathbb{R}^{2} or R3\mathbb{R}^{3} under the Euclidean metric. Now what if the metric changes? Can we visualize them on the space again? One possible answer is that if (R,du)(\mathbb{R},d_{u}) is the usual metric space then the space (R,λdu)(\mathbb{R},\lambda d_{u}) is the scaled metric space whose open unit spheres are going to be λ\lambda times bigger/smaller than the original space. But this explanation is going to work simple looking metrics. We are talking about visualizing open unit spheres of Riemannian manifolds. One may say that yes we can see it; the sphere S2S^{2}, the cube [0,1]3[0,1]^{3}, we can draw them and it has its own Riemannian metric. But my question is what if we have a Riemannian metric, for example ds2=x2dx2+sin⁡y dy2ds^{2}=x^{2}dx^{2}+\sin y\,dy^{2}, how to “see” the open unit sphere under this metric?

In this article we are going to visualize the open unit spheres of a Riemannian manifold equipped with an abstract1 Riemannian metric gg by solving the geodesic equations. We are also going to explore a volume comparison between the open sphere of the manifold and the open Euclidean sphere. The geodesic equations that are arising from the metric can be solved via Python-SciPy’s integrate IVP module, but it will produce a discrete solution, however if we configure SciPy then it will interpolate between the points and provide a continuous solution. But we create a Physics-Informed Neural Network (PINN) model which will solve the equations in a continuous manner. We are applying Neural Network to understand the nature of the solution in a continuous manner rather than having an interpolation of noisy data. This implementation helps us to study real world data and it also shows that PINN can be applied to solve geodesic equations over Riemannian manifolds. We also compare both the solution (PINN vs SciPy) to verify the accuracy and stability of the model.

Related works

This kind of work is not new in computational Riemannian geometry. In the past these works were done manually i.e., by hand. One can see the work of Hui and his coauthors [5, 7, 6, 8] for such investigations. But after the involvement of mathematical softwares like Mathematica, Matlab and Python especially after the introduction of symbolic computations several researchers have been investigating Riemannian manifolds and its various curvature tensors. One can see the work of Shaikh et al. [13, 12] for analysis on space-time metrics. For computations over vector field related equations we refer to the works of Blaga [4, 2, 3]. On the other hand several nonlinear differential equations were being solved using PINN, in this regard the works of Sur [15, 14] is worth mentioning. Other research leads to theoretical understanding of the space where as this article provides a direct visualization of the unseen open spheres of the Riemannian space. To the best of the authors knowledge and belief this kind of study is new to computational Riemannian geometry that brings a direct visualization of the open spheres of abstract Riemannian metrics.

Preliminaries

We start with recalling some important notions that have been used in this article. For detailed study we recommend the book of J. M. Lee [9] for Riemannian geometry and Geodesics in Riemannian manifolds, for PINN we recommend Bai [1] and Liu [10].

Riemannian manifold and Riemannian metric

An nn-dimensional Riemannian manifold is an nn-dimensional smooth manifold MM with a globally defined 2-form g:χ(M)×χ(M)→C∞(M)g:\chi(M) \times\chi(M) \to C^\infty(M) which is

  1. positive definite i.e., g(X,X)≥0g(X,X) \ge0, ∀X∈χ(M)\forall X \in\chi(M) and g(X,X)=0⟺X=0g(X,X) = 0 \Longleftrightarrow X = 0.

  2. symmetric i.e., g(X,Y)=g(Y,X)g(X,Y) = g(Y,X), ∀X,Y∈χ(M)\forall X,Y \in\chi(M).

  3. C∞(M)C^\infty(M)-bilinear i.e., g(fX,Y)=g(X,fY)=fg(X,Y)g(fX,Y) = g(X,fY) = fg(X,Y), ∀f∈C∞(M)\forall f \in C^\infty(M), ∀X,Y∈χ(M)\forall X,Y \in\chi(M).

This 2-form is actually an inner product in the tangent spaces Tp(M)T_p(M) for each p∈Mp \in M. Let p,q∈Mp,q \in M and let γ:[0,1]→M\gamma:[0,1] \to M be a smooth curve, then the length of the curve is given by

ℓ(γ)=∫01g(γ˙(t),γ˙(t)) dt.(1)\ell(\gamma) = \int_0^1 \sqrt{g(\dot{\gamma}(t),\dot{\gamma}(t))}\,\mathrm{d}t. \tag*{(1)}

This length functional is independent of parametrization. So we can measure the distance between any two points p,qp,q on the manifold MM by the metric induced by the length structure given by

dℓ(p,q)=inf⁡γ{ℓ(γ)∣γ:[0,1]→C∞M, γ(0)=p, γ(1)=q}.(2)d_\ell(p,q) = \inf_{\gamma} \left\{\ell(\gamma) \mid\gamma:[0,1] \xrightarrow{C^\infty} M,\ \gamma(0)=p,\ \gamma(1)=q\right\}. \tag*{(2)}

As the distance metric dℓd_\ell depends solely on the coefficients of gg, so gg is called the Riemannian metric. If one fixes an orthonormal basis {ei:i=1,2,…,n}\{e_i:i=1,2,\ldots,n\} for χ(M)\chi(M) then we have a local expression (also known as local form) of gg given by

gij=g(ei,ej).g_{ij}=g(e_i,e_j).

These gijg_{ij} coefficients are real valued functions of nn variables x1,x2,⋯ ,xnx_1,x_2,\cdots,x_n and it forms a symmetric matrix which we denote as gg (the same notation) and we write

g=(g11g12g13⋯g1ng21g22g23⋯g2ng31g32g33⋯g3n⋮⋮⋮⋱⋮gn1gn2gn3⋯gnn)(3)g=\begin{pmatrix} g_{11} & g_{12} & g_{13} & \cdots& g_{1n}\\ g_{21} & g_{22} & g_{23} & \cdots& g_{2n}\\ g_{31} & g_{32} & g_{33} & \cdots& g_{3n}\\ \vdots& \vdots& \vdots& \ddots& \vdots\\ g_{n1} & g_{n2} & g_{n3} & \cdots& g_{nn} \end{pmatrix} \tag*{(3)}

For our numerical computation we will be using this form to consider our matrix of the Riemannian metric. For any two points p,q∈Mp,q\in M, a curve γ:[0,1]→M\gamma:[0,1]\to M joining them is said to be the shortest path if dℓ(p,q)=ℓ(γ)d_{\ell}(p,q)=\ell(\gamma). In the next section we will be discussing geodesics and we will show how the shortest paths becomes the geodesics.

1.3.2. Geodesics in Riemannian manifolds. A Riemannian metric contains important information about the geometric structure of the underlying manifold, particularly its curvature. The curvature of a Riemannian manifold is determined by its Levi-Civita connection, whose local representation is given by the Christoffel symbols. These symbols are computed from the metric tensor and its first-order partial derivatives. The Christoffel symbols associated with a Riemannian metric gg are defined in local coordinates by

Γjki=12gil(∂gkl∂xj+∂gjl∂xk−∂gjk∂xl)(4)\Gamma^{i}_{jk}=\frac{1}{2}g^{il}\left(\frac{\partial g_{kl}}{\partial x^{j}}+\frac{\partial g_{jl}}{\partial x^{k}}-\frac{\partial g_{jk}}{\partial x^{l}}\right) \tag*{(4)}

where gilg^{il} denotes the components of the inverse metric tensor. The Christoffel symbols describe the local behavior of the Levi-Civita connection and are used to express covariant derivatives in local coordinates. In particular, they determine the Riemann curvature tensor, which measures the failure of covariant derivatives to commute.

The Riemann curvature tensor is defined by

R(X,Y)Z=∇X∇YZ−∇Y∇XZ−∇[X,Y]Z,∀X,Y,Z∈χ(M),(5)R(X,Y)Z=\nabla_X\nabla_Y Z-\nabla_Y\nabla_X Z-\nabla_{[X,Y]}Z,\qquad\forall X,Y,Z\in\chi(M), \tag*{(5)}

where χ(M)\chi(M) denotes the space of smooth vector fields on MM, ∇\nabla is the Levi-Civita connection, and [X,Y][X,Y] is the Lie bracket of vector fields. The Riemann curvature tensor is a tensor field of type (1,3)(1,3), and its local components, under the convention R(∂k,∂l)∂j=Rjkli∂iR(\partial_k,\partial_l)\partial_j=R^{i}_{jkl}\partial_i, are given by

Rjkli=∂Γlji∂xk−∂Γkji∂xl+ΓkmiΓljm−ΓlmiΓkjm.(6)R^{i}_{jkl}=\frac{\partial\Gamma^{i}_{lj}}{\partial x^{k}}-\frac{\partial\Gamma^{i}_{kj}}{\partial x^{l}}+\Gamma^{i}_{km}\Gamma^{m}_{lj}-\Gamma^{i}_{lm}\Gamma^{m}_{kj}. \tag*{(6)}

Contracting the first and third tensor indices yields the Ricci curvature tensor. Its local expression is

Rjk=Rjiki,(7)R_{jk}=R^{i}_{jik}, \tag*{(7)}

where the repeated index ii is summed over as per Einstein’s summation convention. A further contraction with respect to the indices jj and kk gives the scalar curvature:

R=gjkRjk.(8)R=g^{jk}R_{jk}. \tag*{(8)}

These local expressions are useful for computing the components of the Christoffel symbols, the Riemann curvature tensor, the Ricci tensor, and the scalar curvature symbolically.

The Christoffel symbols also play a fundamental role in determining the geodesics of a Riemannian manifold. Geodesics are curves whose tangent vectors are parallel transported along the curves themselves. Let γ(t)=(x1(t),…,xn(t))\gamma(t) = (x^1(t), \ldots, x^n(t)) be a smooth curve on MM, with tangent vector

γ˙(t)=dxidt∂∂xi.(9)\dot{\gamma}(t) = \frac{dx^i}{dt}\frac{\partial}{\partial x^i}. \tag*{(9)}

A curve is a geodesic if its covariant acceleration vanishes, that is,

∇γ˙γ˙=0.(10)\nabla_{\dot{\gamma}}\dot{\gamma} = 0. \tag*{(10)}

Expressing this condition in local coordinates and using the Christoffel symbols gives the geodesic equations

d2xidt2+Γjkidxjdtdxkdt=0,i=1,2,…,n.(11)\frac{d^2x^i}{dt^2} + \Gamma^i_{jk}\frac{dx^j}{dt}\frac{dx^k}{dt} = 0, \qquad i = 1,2,\ldots,n. \tag*{(11)}

Thus, the Christoffel symbols determine how the coordinate components of the velocity of a geodesic change along the curve. Since the Christoffel symbols are determined by the metric and its first-order derivatives, the geodesic equations describe how the metric governs the local behavior of geodesics. Consequently, both curvature computations and geodesic calculations can be carried out symbolically once the metric tensor is specified.

Physics-Informed Neural Network

Physics-Informed Neural Network is a particular type of neural network from Deep Learning which helps us to solve mathematical problems by incorporating known physical laws, such as differential equations, into the training process. In ordinary machine learning, a neural network generally learns from a given set of data. In a PINN, the network learns from data and from the governing equations of the problem. Some times we often let the system learn from the governing equations only to produce a data independent model and then compare the model’s solution to known experimental data for accuracy. This makes PINNs particularly useful for solving ordinary differential equations (ODEs), partial differential equations (PDEs), and certain inverse problems. The framework was popularized by Raissi, Perdikaris, and Karniadakis in their 2019 paper [11].

Mathematical formulation of PINN:

Consider a general differential equation of the form

D[u](x)=f(x),x∈Ω,(12)\mathcal{D}[u](x) = f(x), \qquad x \in\Omega, \tag*{(12)}

where Ω⊂Rn\Omega\subset\mathbb{R}^n denotes the computational domain, uu is the unknown function, D\mathcal{D} is a differential operator, and ff is a given source term.

A Physics-Informed Neural Network (PINN) approximates the unknown solution uu by a neural network uθu_\theta, where θ\theta represents the trainable parameters of the network. Thus, we write

u(x)≈uθ(x).(13)u(x) \approx u_\theta(x). \tag*{(13)}

To incorporate the governing differential equation into the training process, we define the physics residual as

pθ(x)=D[uθ](x)−f(x).(14)p_\theta(x)=\mathcal{D}[u_\theta](x)-f(x). \tag*{(14)}

If the neural network satisfies the differential equation exactly, then pθ(x)=0p_\theta(x)=0 throughout the domain Ω\Omega. In practice, the residual is evaluated at a finite collection of collocation points {xi}i=1Np⊂Ω\{x_i\}_{i=1}^{N_p}\subset\Omega, where NpN_p denotes the number of collocation points. The corresponding physics loss is defined by

Lp=1Np∑i=1Np∣pθ(xi)∣2.(15)\mathcal{L}_p=\frac{1}{N_p}\sum_{i=1}^{N_p}\left|p_\theta(x_i)\right|^2. \tag*{(15)}

Suppose that the differential equation is subject to the boundary condition

u(x)=ϕ(x),x∈∂Ω,(16)u(x)=\phi(x),\qquad x\in\partial\Omega, \tag*{(16)}

where ∂Ω\partial\Omega denotes the boundary of the domain and ϕ\phi is a prescribed boundary function. The boundary condition is incorporated into the training process through the boundary loss

Lb=1Nb∑i=1Nb∣uθ(xib)−ϕ(xib)∣2,(17)\mathcal{L}_b=\frac{1}{N_b}\sum_{i=1}^{N_b}\left|u_\theta(x_i^b)-\phi(x_i^b)\right|^2, \tag*{(17)}

where {xib}i=1Nb\{x_i^b\}_{i=1}^{N_b} are points on the boundary ∂Ω\partial\Omega, and NbN_b is the number of boundary points.

The total loss function is then constructed as a weighted combination of the physics loss and the boundary loss:

L(θ)=λpLp+λbLb,(18)\mathcal{L}(\theta)=\lambda_p\mathcal{L}_p+\lambda_b\mathcal{L}_b, \tag*{(18)}

where λp\lambda_p and λb\lambda_b are nonnegative weighting parameters that control the relative contributions of the two loss terms. The optimal network parameters are obtained by solving the minimization problem

θ∗=arg min⁡θ L(θ).(19)\theta^*=\underset{\theta}{\operatorname{arg\,min}}\ \mathcal{L}(\theta). \tag*{(19)}

The minimization is typically performed using gradient-based optimization algorithms. The derivatives of the neural network output with respect to the input coordinates, which are required to evaluate the differential operator D\mathcal{D}, can be computed efficiently using automatic differentiation.

If observational data are available, an additional data-fitting term can be incorporated into the loss function. For example, given observations {(xid,uid)}i=1Nd\{(x_i^d,u_i^d)\}_{i=1}^{N_d}, the data loss can be defined as

Ld=1Nd∑i=1Nd∣uθ(xid)−uid∣2.(20)\mathcal{L}_d=\frac{1}{N_d}\sum_{i=1}^{N_d}\left|u_\theta(x_i^d)-u_i^d\right|^2. \tag*{(20)}

In this case, the total loss may be written as

L(θ)=λpLp+λbLb+λdLd,(21)\mathcal{L}(\theta)=\lambda_p\mathcal{L}_p+\lambda_b\mathcal{L}_b+\lambda_d\mathcal{L}_d, \tag*{(21)}

where λd\lambda_d is the weight assigned to the data loss.

Thus, a PINN combines the governing differential equation, boundary conditions, and, when available, observational data within a unified optimization framework. This approach allows the neural network to approximate solutions of differential equations even when exact solutions or extensive training data are unavailable.

In our case, we are going to implement PINN into solving geodesic equations (11) formed by the metric gg in (2) with suitably chosen initial conditions. It should be mentioned here that we are not going to use experimental data for our PINN model, so that the network will learn the system by itself and we will use the SciPy solution only to compare the accuracy of the model’s solution. We specify all the working methodologies in the next section.

Working Method and Configurations

Working method

Step-I (Dimension): First we fix the dimension nn. For our case it is n=3n=3. We are taking a 3 dimensional manifold so that we can have a relatable visualization. Jumping into higher dimension will be easy once we can see what is happening in the lower dimension. One may also consider the same experiment on dimension 2. We also intent to investigate dimension 4 with space-time metrics with possibly singularities in near future.

Step-II (Domain and Coordinate): Next we fix a domain Ω⊂R3\Omega\subset\mathbb{R}^{3} with coordinate x,y,zx,y,z in which the Riemannian metric will be defined. In general case the unit cube [0,1]3[0,1]^{3} serves the purpose. But in our case we relax this case by choosing globally defined metric which has no singularity in the whole of R3\mathbb{R}^{3}, thus in our case we specify Ω={(x,y,z)∈R3:x>0}⊂R3\Omega=\{(x,y,z)\in\mathbb{R}^{3}:x>0\}\subset\mathbb{R}^{3}. However, the parameter τ\tau that controls the geodesic trajectory is taken in the interval [0,2][0,2] so that half length of the geodesic can be traced out in [0,1][0,1]. The reason behind choosing x>0x>0 is specified in the next section.

Step-III (The Riemannian metric): After domain specification we specify the Riemannian metric gg in matrix form. In our case we are dealing with a 3 dimensional matrix which is given by

g=(1000x20001), x>0.g=\begin{pmatrix}1&0&0\\0&x^{2}&0\\0&0&1\end{pmatrix},\ x>0.

We prefer to start with a simple metric and just changing one element may seem to be not so interesting but the results are very impressive as this will directly show us the effect of changing one parameter in the metric or in the line element. In our case the line element is

ds2=dx2+x2dy2+dz2, x>0.ds^{2}=dx^{2}+x^{2}dy^{2}+dz^{2},\ x>0.

We are going to visualize the open spheres under this metric gg. We keep the metric to be positive definite for now but in future we may extend this to negative definite or indefinite metrics as well.

Step-IV (Study the geometry of gg): Now we use symbolic calculations to find the expressions for Christoffel symbols using (4), Riemann curvature tensor using (6), Ricci curvature using (7), Scalar curvature using (8).

Step-V (Einstein manifold and Flatness checking) [Optional]: It is not a necessary step but we like to keep it in the algorithm part so that we can report this additional information. A manifold is said to be Einstein if Ric⁡=λg\operatorname{Ric} = \lambda g for some scalar λ\lambda. A manifold is said to be flat if its Riemann curvature vanishes identically, i.e., all of the Riemann curvature components are zero. Similarly, a Ricci flat manifold is the one with vanishing Ricci curvature. So Einstein manifolds can be considered as an extension of Ricci flat manifolds. It has various applications in Astrophysics and Cosmology. We can check for all nonzero terms of Riemann and Ricci tensors after the computation. Depending on their vanishing we will present our verdict. For Einstein manifold checking, we simply compute Ric⁡−λg\operatorname{Ric} - \lambda g and compare it with the O3×3O_{3 \times3} (the null matrix), here we solve for λ\lambda and depending on the number of solutions we will say whether it is Einstein manifold or not.

Step-VI (Geodesic equations): Next using the Christoffel symbols and the coordinates, we form the geodesic equations. We solve them using SciPy’s integrate module. In our case we will have the solution of the form G={(x(τ),y(τ),z(τ)):τ∈[0,2]}G = \{(x(\tau), y(\tau), z(\tau)) : \tau\in[0, 2]\}. This will form the geodesics in a parametric form. Here x(τ),y(τ),z(τ)x(\tau), y(\tau), z(\tau) satisfies the geodesic equations (11) for our specified metric gg.

Step-VII (PINN): Next we implement PINN to solve the equations and compare the results with SciPy’s outcome. After running the optimizer for 10 different seeds we calculate the overall root mean square error (RMSE) using this formula

Overall RMSE=13N∑i=1N∑j=13(u^ij−uij)2\mathrm{Overall\ RMSE} = \sqrt{\frac{1}{3N}\sum_{i=1}^{N}\sum_{j=1}^{3}(\hat{u}_{ij}-u_{ij})^{2}}

where

N=1000,number of sampled points,u^ij=PINN-predicted value of coordinate j at point i,uij=numerical reference value of coordinate j at point i,i=1,2,⋯ ,N,j=1,2,3 corresponding to x,y,z.\begin{aligned} N &= 1000,\quad\text{number of sampled points},\\ \hat{u}_{ij} &= \text{PINN-predicted value of coordinate }j\text{ at point }i,\\ u_{ij} &= \text{numerical reference value of coordinate }j\text{ at point }i,\\ i &= 1,2,\cdots,N,\\ j &= 1,2,3\text{ corresponding to }x,y,z. \end{aligned}

Please refer to Table 2 for the numerical values.

Table 2. Error metrics for ten independent PINN runs with different random seeds.

SeedCoordinateMAERMSEMaxAEOverall RMSE
1234xx1.475333×10−41.475333 \times10^{-4}1.801110×10−41.801110 \times10^{-4}3.399890×10−43.399890 \times10^{-4}1.144660×10−41.144660 \times10^{-4}
yy3.439841×10−53.439841 \times10^{-5}4.341200×10−54.341200 \times10^{-5}7.044621×10−57.044621 \times10^{-5}
zz6.393794×10−56.393794 \times10^{-5}7.058888×10−57.058888 \times10^{-5}1.122085×10−41.122085 \times10^{-4}
1235xx5.113784×10−35.113784 \times10^{-3}5.295075×10−35.295075 \times10^{-3}7.063421×10−37.063421 \times10^{-3}3.638967×10−33.638967 \times10^{-3}
yy1.526544×10−31.526544 \times10^{-3}1.569376×10−31.569376 \times10^{-3}1.985233×10−31.985233 \times10^{-3}
zz2.936206×10−32.936206 \times10^{-3}3.037348×10−33.037348 \times10^{-3}3.953934×10−33.953934 \times10^{-3}
1236xx4.181847×10−44.181847 \times10^{-4}4.715432×10−44.715432 \times10^{-4}7.168459×10−47.168459 \times10^{-4}3.653336×10−43.653336 \times10^{-4}
yy7.321597×10−57.321597 \times10^{-5}9.054659×10−59.054659 \times10^{-5}2.007484×10−42.007484 \times10^{-4}
zz4.063160×10−44.063160 \times10^{-4}4.121339×10−44.121339 \times10^{-4}4.953508×10−44.953508 \times10^{-4}
1237xx5.677972×10−45.677972 \times10^{-4}6.236564×10−46.236564 \times10^{-4}9.560724×10−49.560724 \times10^{-4}3.917300×10−43.917300 \times10^{-4}
yy1.602889×10−41.602889 \times10^{-4}1.783923×10−41.783923 \times10^{-4}2.461938×10−42.461938 \times10^{-4}
zz1.728306×10−41.728306 \times10^{-4}1.989624×10−41.989624 \times10^{-4}3.289656×10−43.289656 \times10^{-4}
1238xx5.162852×10−35.162852 \times10^{-3}5.186230×10−35.186230 \times10^{-3}5.921158×10−35.921158 \times10^{-3}3.713242×10−33.713242 \times10^{-3}
yy1.331224×10−31.331224 \times10^{-3}1.351524×10−31.351524 \times10^{-3}1.674414×10−31.674414 \times10^{-3}
zz3.552884×10−33.552884 \times10^{-3}3.555404×10−33.555404 \times10^{-3}3.729424×10−33.729424 \times10^{-3}
1239xx1.905061×10−41.905061 \times10^{-4}2.423644×10−42.423644 \times10^{-4}4.548552×10−44.548552 \times10^{-4}1.499765×10−41.499765 \times10^{-4}
yy4.927924×10−54.927924 \times10^{-5}5.595751×10−55.595751 \times10^{-5}8.532256×10−58.532256 \times10^{-5}
zz5.685171×10−55.685171 \times10^{-5}7.488056×10−57.488056 \times10^{-5}1.519464×10−41.519464 \times10^{-4}
1240xx2.048747×10−42.048747 \times10^{-4}2.624104×10−42.624104 \times10^{-4}4.853309×10−44.853309 \times10^{-4}1.611155×10−41.611155 \times10^{-4}
yy4.898126×10−54.898126 \times10^{-5}5.419302×10−55.419302 \times10^{-5}8.166822×10−58.166822 \times10^{-5}
zz5.842658×10−55.842658 \times10^{-5}7.796503×10−57.796503 \times10^{-5}1.593409×10−41.593409 \times10^{-4}
1241xx2.516110×10−32.516110 \times10^{-3}2.576858×10−32.576858 \times10^{-3}3.237878×10−33.237878 \times10^{-3}1.726738×10−31.726738 \times10^{-3}
yy5.398933×10−45.398933 \times10^{-4}5.412438×10−45.412438 \times10^{-4}5.860503×10−45.860503 \times10^{-4}
zz1.397981×10−31.397981 \times10^{-3}1.418353×10−31.418353 \times10^{-3}1.695860×10−31.695860 \times10^{-3}
1242xx1.551430×10−41.551430 \times10^{-4}1.901201×10−41.901201 \times10^{-4}3.664752×10−43.664752 \times10^{-4}1.207510×10−41.207510 \times10^{-4}
yy4.965467×10−54.965467 \times10^{-5}5.578220×10−55.578220 \times10^{-5}8.464544×10−58.464544 \times10^{-5}
zz5.297984×10−55.297984 \times10^{-5}6.697122×10−56.697122 \times10^{-5}1.326309×10−41.326309 \times10^{-4}
1243xx4.394631×10−24.394631 \times10^{-2}4.430123×10−24.430123 \times10^{-2}4.949229×10−24.949229 \times10^{-2}3.176514×10−23.176514 \times10^{-2}
yy1.305206×10−21.305206 \times10^{-2}1.314090×10−21.314090 \times10^{-2}1.490195×10−21.490195 \times10^{-2}
zz2.951794×10−22.951794 \times10^{-2}2.986286×10−22.986286 \times10^{-2}3.465152×10−23.465152 \times10^{-2}

Table 2. MAE: mean absolute error; RMSE: root mean squared error; MaxAE: maximum absolute error. The overall RMSE is computed across all three coordinates and all sampled parameter values.

Step-VIII (Spike Diagram): After that we implement our custom made python code to plot the geodesic spike diagram. The spike diagram is basically tracing all the points on the surface of a sphere (finite number of points) from the center of a sphere derived from the geodesic equations. In the later section we will discuss in detail about this diagram.

Step-IX (Mesh creation for the geodesic open sphere): Using python’s inbuilt codes we are able to construct the surface formed by the end points of the geodesics derived in the earlier step. We call this closed surface a geodesic sphere or geodesic open sphere.

Step-X (Analysis on the newly formed geodesic sphere): Now we do certain analysis by answering questions like: How much it is different from the Euclidean sphere? Which side of the geodesic sphere is compressed and which side is expanded compared to the Euclidean sphere? What is the relative volume / surface area difference between them?

Configurations

Device Configurations

We are using free version of Google Colab (Python 3 Google Compute Engine backend (GPU)) T4 GPU with system RAM 12.7 GB, GPU RAM 15 GB, Disk 112.6 GB. However, the code can be executed through Python 3 CPU, but it would take a little long time for the whole evaluation.

Architecture of the Physics-Informed Neural Network

Our Physics-Informed Neural Network consists of 6 layers in total in which 1 input layer (with 1 neuron τ\tau), 4 hidden layers each equipped with 64 neurons each and 1 output layer (with 3 neurons x(τ)x(\tau), y(τ)y(\tau), z(τ)z(\tau)). Only two types of derivatives are involved ddτ\frac{d}{d\tau} and d2dτ2\frac{d^2}{d\tau^2} and they are used under automatic differentiation. Three ODEs are involved with 6 initial conditions (3 conditions for initial points and 3 conditions for initial velocities foe each of the output variables). We used Adam optimizer with learning rate 10−310^{-3} and number of iterations are 10000 for each execution. Our loss function is given by

L(θ)=λpLp+λbLb,\mathcal{L}(\theta) = \lambda_p \mathcal{L}_p + \lambda_b \mathcal{L}_b,

where Lp\mathcal{L}_p denotes the loss in physics (i.e., loss in learning the governing equations) and Lb\mathcal{L}_b is the loss in learning the boundary/initial conditions. The λp,λb\lambda_p,\lambda_b are the weights for the physics loss and boundary loss functions. We are letting the network learn the ODEs by the physics and boundary/initial conditions only, and we do not invoke any experimental data points. We only use the SciPy data to compare the results with the PINN. We are executing the neural network for 10 random seeds starting from 1234 and up to 1243. This makes the network add different weights to the loss function and from here we find the best seed by choosing the minimum overall root mean square error (RMSE). We used Tanh as activation function and Glorot Uniform as initializer. The network architecture diagram is given here for readers convenience.

PINN Architecture under Adam optimizer

Figure 1. PINN Architecture under Adam optimizer

Results and Discussions

Computation time

First let us mention the computation time for the execution of the Python script on Google Colab T4 GPU using the same configuration as mentioned in § 2.2.

  • Calculating symbolic Christoffel symbol, Riemann, Ricci and Scalar curvature, Einstein manifold checking and Flatness checking: 6.220 sec

  • Finding geodesic equations: 0.240 sec

  • Installation of DeepXDE: 10.100 sec

  • PINN 10 seeds each with 10k iterations total time: 315.777 sec

  • Volume comparison : 60.05 sec

Estimated Total time: 6 minutes 32.387 seconds.

Remark 1. It should be mentioned here that the parameters we have chosen for this experiment are not random. They are chosen after multiple execution of the program and several failures. Sometimes the method took long time to respond and sometimes it was faster but the errors were drastic. After a careful observation and keeping the time of execution in mind we have finalized the parameter values.

Results on the geometry of the metric

We are considering (M,g)(M,g) as our manifold where M={(x,y,z)∈R3,x>0}M = \{(x,y,z) \in\mathbb{R}^{3}, x > 0\}, x,y,zx,y,z as the coordinates in the manifold and the metric gg is defined by

g=(1000x20001).g = \begin{pmatrix} 1 & 0 & 0 \\ 0 & x^{2} & 0 \\ 0 & 0 & 1 \end{pmatrix}.

So the line element becomes

ds2=dx2+x2dy2+dz2.ds^{2} = dx^{2} + x^{2}dy^{2} + dz^{2}.

Remark 2. *We have chosen this region so that gg remains positive definite, which is necessary for our experiment. Also the reason behind choosing such simple metric is that we had no idea about the outcome. To make sure we have very good control over the metric we are changing just one diagonal element and keeping the remaining the same as Euclidean metric. In future, we have plan to investigate over complex metrics, degenerate and indefinite metrics along with metrics with singularity.

The nonzero components of the Christoffel symbols for gg are

Γ221=−x\Gamma^{1}_{22}=-x
Γ122=Γ212=1x.\Gamma^{2}_{12}=\Gamma^{2}_{21}=\frac{1}{x}.

All of the Riemann, Ricci and Scalar curvature for the metric gg are zero. So the manifold is a flat manifold.

The geodesic equations for gg are given by

−x(τ)(ddτy(τ))2+d2dτ2x(τ)=0,x(τ)d2dτ2y(τ)+2ddτx(τ)ddτy(τ)=0,d2dτ2z(τ)=0.(22)\begin{aligned} -x(\tau)\left(\frac{d}{d\tau}y(\tau)\right)^2+\frac{d^2}{d\tau^2}x(\tau)&=0,\\ x(\tau)\frac{d^2}{d\tau^2}y(\tau)+2\frac{d}{d\tau}x(\tau)\frac{d}{d\tau}y(\tau)&=0,\\ \frac{d^2}{d\tau^2}z(\tau)&=0. \tag*{(22)} \end{aligned}

To solve the system (22) we assume that at τ∈[0,2]\tau\in[0,2] and at τ=0\tau=0 we have

x(0)=2,x′(0)=1/2,y(0)=2,y′(0)=1/2,z(0)=2,z′(0)=1/2.\begin{aligned} x(0)&=2, & x'(0)&=1/2,\\ y(0)&=2, & y'(0)&=1/2,\\ z(0)&=2, & z'(0)&=1/2. \end{aligned}

Results of PINN

Now we apply both SciPy Integrate Solve IVP with DOP853 method (which is 8th order Runge-Kutta Numerical Solver with 5th order error estimator) and our PINN to get the solution. We have done random seed experiments starting seen number from 1234 up to 1243 and the following graphs shows the test-train loss for each experiment.

Test loss and Training loss graph for 10 random seed PINN execution

Figure 2. Test loss and Training loss graph for 10 random seed PINN execution

The Table 2 shows the error metrics of each experiment. As you can see the best performance on the basis of minimum overall RMSE is achieved by the first seed 1234 (See Table 2). So interested reader can use this seed to reconstruct the same result or may find another seed for better outcome. The Table 3 gives a comparison of final position at τ=2\tau=2 predicted by Numerical solution and PINN solution. Tables are placed at the end of the section for better readability.

Table 3. Comparison at τ=2\tau= 2 (geodesic end points PINN vs Numerical).

Methodx(2)x(2)y(2)y(2)z(2)z(2)
Numerical3.605551282.588002603.00000000
PINN3.605436302.587947803.00008150

Table 3.

Now let us see the solution comparison between PINN and Numerical method. See Figure 3. The PINN solution lines almost coincides with te numerical solution.

PINN and numerical solution comparison

Figure 3.

To understand how close is the PINN prediction we show the box plots of the errors generated at each seed.

Error distributions across random seeds

Figure 4.

Honestly, we did not expected the model to produce such a small box plot for each run. It is very good to get such small errors for each of the run except for the last one. This shows the model’s stability over multiple runs. We suspect that further tuning the model’s configuration may lead to a more stabilized prediction. For this run the overall RMSE is 1.144660×10−41.144660 \times10^{-4}. If one runs the code again, they may get a different RMSE and different seed.

Results on Geodesic Spike Diagram

Now we are ready to visualize the geodesic spike diagram. Let pp be a point fixed in R3\mathbb{R}^{3} and let S(p,1)S(p,1) be the unit sphere around the point pp i.e., S(p,1)={x∈R3:∥x−p∥2=1}S(p,1)=\{x\in\mathbb{R}^{3}: \lVert x-p\rVert_{2}=1\}. First we discretize the sphere into finite number of points. Then draw the geodesics (produced by gg) starting from the center pp to all the other points on the surface. This will create a spike like diagram. For the Euclidean metric, the shortest paths are straight lines. If we draw the same for Euclidean metric then all we are going to see a bunch of finite sticks glues at one point. Topologically speaking it is equivalent to [0,1]100/∼[0,1]^{100}/\sim where ∼\sim identifies the 0 of each interval. This is what we mean by spike diagram. For arbitrary Riemannian metric we are interested is the diagram, this will give us an idea what does the unit sphere will look like under the metric gg.

For this visualization we are creating 15 points along the θ\theta coordinate and 30 points in the ϕ\phi coordinate on the unit sphere. As a total we have 450 points in the surface to which geodesics are going to be connected. However, we will see 422 geodesics in the plot. Why? To visualize the geodesics emanating from the center (fixed point), we discretize the unit sphere of initial directions using Nθ=15N_{\theta}=15 polar subdivisions and Nϕ=30N_{\phi}=30 azimuthal subdivisions. Since all azimuthal angles represent the same direction at each pole, only one direction is retained at each pole. Hence, the total number of distinct initial directions is

Ngeo=(Nθ−1)Nϕ+2=(15−1)×30+2=422.N_{\mathrm{geo}}=(N_{\theta}-1)N_{\phi}+2=(15-1)\times30+2=422.

Each initial direction determines a geodesic initial-value problem, which is numerically solved using SciPy’s DOP853 method. Thus, at most 422 geodesic trajectories are obtained, depending on the success of numerical integration. This number depends on the chosen angular resolution and does not represent the total number of geodesics on the manifold.

Geodesic Spike diagram for the metric (2)

Figure 5. Geodesic Spike diagram for the metric (2)

Construction of Geodesic Sphere

Now we make a triangular mesh to construct the surface formed by the displaced points of the deformed sphere. We call this the geodesic sphere. Since the metric we have considered in (2) is very close to Euclidean metric, so plotting the open sphere is of no use as the human eye can not tell the difference between this image and the Euclidean sphere. To explicitly visualize the change we compare the newly generated geodesic sphere with Euclidean unit sphere S2S^2. First comparison comes in form of compression and decompression. Let us define the displacement at the ii-th point as

Δi=∥xigeodesic−xiEuclidean∥2\Delta_i = \left\lVert x_i^{\mathrm{geodesic}} - x_i^{\mathrm{Euclidean}} \right\rVert_2

where xigeodesicx_i^{\mathrm{geodesic}} is the endpoint of the ii-th geodesic, xiEuclideanx_i^{\mathrm{Euclidean}} is the corresponding point on the reference Euclidean sphere, Δi\Delta_i is the Euclidean coordinate distance between the two corresponding points. Plotting the heat map on the geodesic sphere gives us a nice visualization.

Spatial distance comparison

This graph (Figure 6) gives an idea about the parts of the open sphere of the Riemannian metric where it has a difference with the Euclidean unit sphere. Next we consider the signed radial deviation. The signed radial deviation measures how far a geodesic endpoint lies from the reference sphere in the radial direction. It is defined as

Geodesic sphere created from the geodesic spike diagram

Figure 6. Geodesic sphere created from the geodesic spike diagram

δi=∥xigeodesic−p∥2−R\delta_i = \left\lVert\mathbf{x}_i^{\mathrm{geodesic}} - p \right\rVert_2 - R

where p=(2,2,2)p=(2,2,2) is the common center of the two constructions and RR is the radius of the reference Euclidean sphere, here R=1R=1. The sign of δi\delta_i indicates the endpoint’s radial position:

  1. δi>0\delta_i>0: the geodesic endpoint lies outside the reference sphere.

  2. δi<0\delta_i<0: the geodesic endpoint lies inside the reference sphere.

  3. δi=0\delta_i=0: the geodesic endpoint lies on the reference sphere.

Remark 3. The displacement Δi\Delta_i measures the full Euclidean distance between corresponding points, whereas δi\delta_i measures only the difference in their distances from the common center. These quantities are generally different. Neither directly represents intrinsic curvature.

Before going into the signed distance deviation let us see the effect of Δi\Delta_i in the Euclidean sphere.

Displacement heat maps ($\Delta_i$) on $\mathrm{S}^2$

Figure 7. Displacement heat maps (Δi\Delta_i) on S2\mathrm{S}^2

This image is on the Euclidean sphere, and this represents which part has a change when the metric is invoked. Now for the signed distance deviation heatmap on the Euclidean sphere we present the following diagram.

It can be seen from here that contraction is happening when the metric is involved in R3\mathbb{R}^3. This is what we are looking for, this visualization answers one of the fundamental questions which is “what does the Riemannian metric does to the unit sphere?” Answer: Figure 8 is what is does to the sphere.

Signed distance deviation heat maps ($\delta_i$) on $\mathrm{S}^2$

Figure 8. Signed distance deviation heat maps (δi\delta_i) on S2\mathrm{S}^2

The next question comes to mind is, Can we compare the change in volume and surface for this newly generated geodesic sphere with the Euclidean sphere? Yes we can and now we are going to do the same.

Since the surface of the geodesic sphere is made of triangular meshes so we can numerically compute all the necessary information.

Intrinsic Riemannian Area and Volume Comparison

Till now we have (M,g)(M,g) as a three-dimensional Riemannian manifold with metric tensor g=(gij)g=(g_{ij}). For a geodesic sphere of radius RR centered at p∈Mp \in M, we compare its intrinsic area and volume with those of a Euclidean sphere and sphere of the same radius. Unlike Euclidean mesh calculations, which use the vertex coordinates and triangular faces, intrinsic Riemannian quantities are determined by the metric tensor gg.

The intrinsic area of the geodesic sphere is calculated using the induced metric:

Ag(R)=∫0π∫02πEH−F2 dϕ dθ,A_g(R) = \int_{0}^{\pi} \int_{0}^{2\pi} \sqrt{EH - F^2}\,d\phi\,d\theta,

where

E=g(Xθ,Xθ),F=g(Xθ,Xϕ),H=g(Xϕ,Xϕ),E = g(X_\theta, X_\theta), \qquad F = g(X_\theta, X_\phi), \qquad H = g(X_\phi, X_\phi),

and X(θ,ϕ)X(\theta,\phi) parameterizes the geodesic sphere.

The intrinsic volume of the geodesic sphere is calculated by integrating the Riemannian volume density:

Vg(R)=∫0R∫0π∫02πdet⁡g(F) ∣det⁡JF∣ dϕ dθ ds,V_g(R) = \int_{0}^{R} \int_{0}^{\pi} \int_{0}^{2\pi} \sqrt{\det g(F)}\,\lvert\det J_F\rvert\,d\phi\,d\theta\,ds,

where F(s,θ,ϕ)F(s,\theta,\phi) is the geodesic polar map and

JF=∂(x1,x2,x3)∂(s,θ,ϕ)J_F = \frac{\partial(x^1,x^2,x^3)}{\partial(s,\theta,\phi)}

is its coordinate Jacobian matrix. These formulas assume that the geodesic polar map is regular and injective over the sphere.

For comparison, the Euclidean reference values are (R=1R = 1),

AEuc=4πR2,VEuc=43πR3.A_{\mathrm{Euc}} = 4\pi R^2, \qquad V_{\mathrm{Euc}} = \frac{4}{3}\pi R^3.

The percentage differences are

ΔA=100×Ag(R)−AEucAEuc%.\Delta_A = 100 \times\frac{A_g(R)-A_{\mathrm{Euc}}}{A_{\mathrm{Euc}}}\%.
ΔV=100×Vg(R)−VEucVEuc%.\Delta_V = 100 \times\frac{V_g(R)-V_{\mathrm{Euc}}}{V_{\mathrm{Euc}}}\%.

Thus, Euclidean mesh area and volume describe geometry in ambient Euclidean coordinates, whereas intrinsic Riemannian area and volume incorporate the metric tensor gg.

ParameterValue
Center(2, 2, 2)
Geodesic radius1.0
Base grid (NθN_\theta, NϕN_\phi, NrN_r)(30, 60, 40)
Surface Area
Euclidean reference area12.5663706144
Riemannian sphere area12.5208785515
Difference−0.0454920628
Percentage difference−0.362014%
Volume
Euclidean reference volume4.1887902048
Riemannian sphere volume4.1735465537
Difference−0.0152436511
Percentage difference−0.363915%
Grid-Refinement Diagnostics
Refined grid (NθN_\theta, NϕN_\phi, NrN_r)(45, 90, 60)
Refined sphere area12.5461407142
Refined sphere volume4.1820115974
Area change relative to base+0.201354%
Volume change relative to base+0.202416%

Table 1. Intrinsic Riemannian Geodesic sphere Comparison

This shows that at the base resolution, the computed Riemannian sphere area and sphere volume are approximately 0.362014% and 0.363915% smaller than their respective Euclidean reference values. Grid refinement changes the area and volume by approximately 0.201354% and 0.202416%, respectively. These changes indicate numerical sensitivity. Interested readers may investigate on further refinement to establish the convergence. This numerical computations justifies why there are so many blue regions in the Figure 8.

Mathematical Assumptions we have taken.

  • The metric must remain smooth and positive-definite throughout the sampled region.

  • The exponential map must remain injective over the geodesic sphere.

  • The coordinate Jacobian is approximated using finite differences, so the results should be checked at successively finer resolutions.

Numerical limitations. The computed area and volume depend on the chosen grid resolution and the numerical approximation of the coordinate Jacobian. Although grid refinement produces relatively small changes in the computed quantities, these results alone do not establish convergence. Further refinement and error analysis are required to assess the numerical accuracy of the intrinsic area and volume estimates.

Future Works and Conclusion

Future Works

Several extensions of this work are possible. The PINN framework may be investigated for more general Riemannian metrics and higher-dimensional manifolds. Further improvements in neural network architecture, training strategies, and numerical integration may also help improve the accuracy and stability of the computed geodesics. Future work will additionally focus on systematic grid-refinement studies to establish the convergence of the computed intrinsic area and volume as well as on degenerate metrics. For our experiment we solely focused on positive definite metric, thus experimenting with indefinite metrics, or metrics with singularities will lead us to another dimension of this study.

Conclusion

In this work, we presented a computational framework for visualizing geodesics and geodesic spheres associated with an abstract Riemannian metric on R3\mathbb{R}^{3}. The geodesic equations were solved using both SciPy and a Physics-Informed Neural Network (PINN), and their solutions were compared to assess the accuracy of the neural network approximation. The resulting geodesic sphere was compared with the Euclidean reference sphere using displacement visualization and intrinsic area and volume calculations. It was found that, at the base grid resolution, the computed intrinsic area and volume were approximately 0.362% and 0.364% smaller than their Euclidean reference values, respectively. Grid refinement produced small but nonzero changes in these estimates, indicating the need for further numerical convergence studies.

Overall, this work illustrates how numerical differential equation solvers and PINNs can be combined to study and visualize geodesic structures associated with Riemannian metrics. The approach provides a computational framework for exploring geometric properties that may be difficult to visualize directly.

Data availability: The author(s) declare that all the data generated during the study are in the manuscript and no additional data was generated. The python script used for this study is available in the GitHub repository [16]

Funding: The author(s) declare that no funding was received for this work.

Declaration of Generative AI and AI-assisted technologies: The author(s) declares that no generative AI or AI assisted technology is used for the completion of the manuscript.

Conflict of interest: The author(s) declares no conflict of interest.

Acknowledgement: The author(s) acknowledges all the reviewers for giving their valuable suggestions towards the improvement of the manuscript. Sujit Bhattacharyya

Department of Mathematics, Sister Nivedita University, DG 1/2 New Town, Action Area 1, Kolkata - 700156, India

Email: [email protected]

References

  1. [1]J. Bai, H. Jeong, C. P. Batuwatta-Gamage, S. Xiao, Q. Wang, C. M. Rathnayaka, L. Alzubaidi, G.-R. Liu and Y. Gu, An introduction to programming Physics-Informed Neural Network-based computational solid mechanics, arXiv:2210.09060 (2022). https://arxiv.org/pdf/2210.09060.
  2. [2]A. M. Blaga, Constructing Ricci tensor fields on ℝ² with a diagonal metric, Aequationes Mathematicae (2025). DOI: 10.1007/s00010-025-01183-4.
  3. [3]A. M. Blaga, Certain symmetries of ℝ² with diagonal metrics, Journal of Geometry and Physics, 214 (2025), Article 105524.DOI
  4. [4]A. M. Blaga, On certain symmetries of ℝ³ with a diagonal metric, Filomat, 39(24) (2025), 8417–8437.arxiv.org/abs/2505.11001
  5. [5]S. K. Hui, On Weakly W₃-Symmetric Manifolds, Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica, 50(1) (2011), 53–71.
  6. [6]S. K. Hui, Real Hypersurfaces of a Complex Projective Space Satisfying Certain Conditions, Research and Communications in Mathematics and Mathematical Sciences, 6(1) (2016), 37–52.
  7. [7]S. K. Hui and Y. Matsuyama, On Real Hypersurfaces of a Complex Projective Space with Pseudo Parallel Second Fundamental Tensor, Kobe Journal of Mathematics, 32(1–2) (2015), 53–59.DOI
  8. [8]S. K. Hui and Y. Matsuyama, Pseudo Ricci Symmetric Real Hypersurfaces of a Complex Projective Space, Bulletin of the Iranian Mathematical Society, 42(2) (2016), 489–497.
  9. [9]J. M. Lee, Introduction to Riemannian Manifolds, 2nd ed., Graduate Texts in Mathematics, vol. 176, Springer, 2018.DOI
  10. [10]G. R. Liu, PINN with Python: An Introduction, Scientech Publisher, Singapore, 2025.
  11. [11]M. Raissi, P. Perdikaris and G. E. Karniadakis, Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations, J Comput Phys, 378 (2019), 686–707. DOI: 10.1016/j.jcp.2018.10.045.DOI
  12. [12]A. A. Shaikh, S. K. Hui, M. Sarkar and V. Amarendra Babu, Symmetry and Pseudosymmetry Properties of Vaidya-Bonner-de Sitter Spacetime, Journal of Geometry and Physics, 204 (2024), 105235.arxiv.org/abs/2402.10961
  13. [13]A. A. Shaikh, S. K. Hui, B. R. Datta and M. Sarkar, On Curvature Related Geometric Properties of Hayward Black Hole Spacetime, New Astronomy, 108 (2024), Article 102181.arxiv.org/abs/2303.00932
  14. [14]A. Sur, S. M. Hussain, E.-M. Craciun, A. Singhal, N. K. Ranjit, M. Yavlacı and S. Das, Physics-informed neural network and data-driven modeling of non-Fourier heat transfer in laser-irradiated semiconductor media using bt-Helmholtz nonlocal theory, Continuum Mechanics and Thermodynamics, 38 (2026), Article 72.
  15. [15]A. Sur, K. Lotfy, S. Bhattacharyya, R. Dutta and S. Das, A modified physics-informed neural network for microstructural scale effects on heat and mass transfer in fractional thermo-elasto-diffusive porous media, International Communications in Heat and Mass Transfer, 163 (2026), Article 111327.DOI
  16. [16]S. Bhattacharyya, PINN-and-Geodesic-Equations-3D, GitHub (2026), https://github.com/sujitbhattacharyya/PINN-and-Geodesic-Equations-3D

Paper details

vlnc:W_akkms3yv
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY-SA 4.0

Original source

  • Mathematics

Not recorded for this paper · View statement →

Looking for related papers…
Contents