Sreelatha Chandragiri

Dr. Sreelatha Chandragiri

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2023 in The Bulletin of Irkutsk State University. Series Mathematics
Verified
Journal Article
Closed access
PDF file
SMSobolev Institute of Mathematics
Sobolev Institute of Mathematics
SCSreelatha Chandragiri
Sreelatha Chandragiri
The lattice paths can be counted by the virtue of their step vectors that are aligned to the positive octant. A path can go from one point to an infinite others if there is no restriction applied such that each point only has finitely many predecessors. The linear difference equations with non-constant coefficients will be utilised to incorporate this restriction to study lattice paths that lie on or over a line having a rational slope. The generating functions are obtained and is based on developing a specific method to compute the number of restricted lattice paths.

15 September 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
GBGalitdin Bakanovich Bakanov
Galitdin Bakanovich Bakanov
SCSreelatha Chandragiri
Sreelatha Chandragiri
SKSergey I. Kabanikhin
Sergey I. Kabanikhin
MSMaxim A. Shishlenin
Maxim A. Shishlenin
In this paper, we develop the explicit finite difference method (FDM) to solve an ill-posed Cauchy problem for the 3D acoustic wave equation in a time domain with the data on a part of the boundary given (continuation problem) in a cube. FDM is one of the numerical methods used to compute the solutions of hyperbolic partial differential equations (PDEs) by discretizing the given domain into a finite number of regions and a consequent reduction in given PDEs into a system of linear algebraic equations (SLAE). We present a theory, and through Matlab Version: 9.14.0.2286388 (R2023a), we find an efficient solution of a dense system of equations by implementing the numerical solution of this approach using several iterative techniques. We extend the formulation of the Jacobi, Gauss–Seidel, and successive over-relaxation (SOR) iterative methods in solving the linear system for computational efficiency and for the properties of the convergence of the proposed method. Numerical experiments are conducted, and we compare the analytical solution and numerical solution for different time phenomena.

25 March 2024 in Siberian Mathematical Journal
Verified
Journal Article
Closed access
PDF file
SCSreelatha Chandragiri
Sreelatha Chandragiri
We study lattice paths by combinatorial methods on the positive lattice. We give some identity that produces the functional equations and generating functions to counting the lattice paths on or below the main diagonal. Also, we consider the subdiagonal lattice paths in relation to lower triangular arrays. This presents a Riordan array in conjunction with the columns of the matrix of the coefficients of certain formal power series by implying an infinite lower triangular matrix \( F=(f_{x,y})_{x,y\geqslant 0} \). We derive new combinatorial interpretations in terms of restricted lattice paths for some Riordan arrays.

1 January 2026 in The Bulletin of Irkutsk State University. Series Mathematics
Verified
Journal Article
Closed access
PDF file
ALAlexander Lyapin
Alexander Lyapin
MAMarina Apanovich
Marina Apanovich
TYTatiana I. Yakovleva
Tatiana I. Yakovleva
OSOlga A. Shishkina
Olga A. Shishkina
SCSreelatha Chandragiri
Sreelatha Chandragiri
The article is devoted to the scientific and pedagogical activity of Doctor of Physical and Mathematical Sciences, Professor of the Department of Function Theory at Siberian Federal University Evgeniy Konstantinovich Leinartas (1954–2024).