Researcher profile

Ratikanta Behera

Ratikanta Behera contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
9works
0followers
8topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

9 published item(s)

preprint2026arXiv

An adaptive wavelet-based PINN for problems with localized high-magnitude source

In recent years, physics-informed neural networks (PINNs) have gained significant attention for solving differential equations, although they suffer from two fundamental limitations, namely, spectral bias inherent in neural networks and loss imbalance arising from multiscale phenomena. This paper proposes an adaptive wavelet-based PINN (AW-PINN) to address the extreme loss imbalance characteristic of problems with localized high-magnitude source terms. Such problems frequently arise in various physical applications, such as thermal processing, electro-magnetics, impact mechanics, and fluid dynamics involving localized forcing. The proposed framework dynamically adjusts the wavelet basis function based on residual and supervised loss. This adaptive nature makes AW-PINN handle problems with high-scale features effectively without being memory-intensive. Additionally, AW-PINN does not rely on automatic differentiation to obtain derivatives involved in the loss function, which accelerates the training process. The method operates in two stages, an initial short pre-training phase with fixed bases to select physically relevant wavelet families, followed by an adaptive refinement that adapts scales and translations without populating high-resolution bases across entire domains. Theoretically, we show that under certain assumptions, AW-PINN admits a Gaussian process limit and derive its associated NTK structure. We evaluate AW-PINN on several challenging PDEs featuring localized high-magnitude source terms with extreme loss imbalances having ratios up to $10^{10}:1$. Across these PDEs, including transient heat conduction, highly localized Poisson problems, oscillatory flow equations, and Maxwell equations with a point charge source, AW-PINN consistently outperforms existing methods in its class.

preprint2026arXiv

Quaternion Nonlinear Transform-Induced Nuclear Norm for Low-Rank Tensor Completion

Tensor completion has emerged as a powerful framework for recovering missing data in multidimensional signals by exploiting low-rank tensor structures. Among existing approaches, linear transform-based tensor nuclear norm (TNN) methods have achieved considerable success by enforcing low-rankness on transformed frontal slices. However, the low-rank structure revealed by linear transforms remains inherently limited. To better capture intrinsic correlations, nonlinear transform-based TNN (NTTNN) models have been proposed, significantly enhancing low-rank representation through composite transforms. Despite their effectiveness, existing NTTNN methods are restricted to real-valued tensors and fail to model quaternion-valued data, which are essential for preserving inter-channel dependencies in color images and videos. Extending nonlinear TNN models to the quaternion domain is challenging due to the non-commutativity of quaternion multiplication and the complexity of quaternion singular value decomposition. To address the limitations encountered in prior works, we propose a quaternion nonlinear transform-induced tensor nuclear norm (QNTTNN) via a real embedding of quaternions, enabling tractable nuclear norm definitions and efficient optimization. Building upon QNTTNN, we formulate a quaternion tensor completion model and develop a proximal alternating minimization algorithm with rigorous convergence guarantees. Extensive experiments on benchmark color video inpainting datasets validate the superior performance of the proposed method over existing approaches.

preprint2026arXiv

Second-Generation Wavelet-inspired Tensor Product with Applications in Hyperspectral Imaging

This paper introduces the $w$-product, a novel wavelet-based tensor multiplication scheme leveraging second-generation wavelet transforms to achieve linear transformation complexity while preserving essential algebraic properties. The $w$-product outperforms existing tensor multiplication approaches by enabling fast and numerically stable tensor decompositions by proposing ``$w$-svd'' and its sparse variant ``sp-$w$-svd'', for efficient low-rank approximations with significantly reduced computational costs. Experiments on low-rank hyperspectral image reconstruction demonstrate up to a $92.21$ times speedup compared to state-of-the-art ``$t$-svd'', with comparable PSNR and SSIM metrics. We discuss the Moore-Penrose inverse of tensors based on the $w$-product and examine its essential properties. Numerical examples are provided to support the theoretical results. Then, hyperspectral image deblurring experiments demonstrate up to $27.88$ times speedup with improved image quality. In particular, the $w$-product and the sp-$w$-product exhibit exponentially increasing acceleration with the decomposition level compared to the traditional approach of the $t$-product. This work provides a scalable framework for multidimensional data analysis, with future research directions including adaptive wavelet designs, higher-order tensor extensions, and real-time implementations.

preprint2022arXiv

GD1 inverse and 1GD inverse for Hilbert space operators

Mosic and Djordjevic introduced the notation of the gDMP inverse for Hilbert space operators in [J. Spectr. Theory, 8(2):555-573, 2018] by considering generalized Drazin inverse with the Moore-Penrose inverse. This paper introduces two new classes of inverses: GD1 (generalized Drazin and inner) inverse and 1GD (inner and generalized Drazin) inverse for Hilbert space operators. The existence and uniqueness of the GD1 (also 1GD) inverse are discussed, along with some properties through core-quasinilpotent decomposition and closed range decomposition operator. We further establish a few explicit representations of the GD1 inverse and their interconnections with generalized Drazin inverse. In addition, we discuss a few properties of GD1 (also 1GD) inverse through binary relation.

preprint2020arXiv

Further results on weighted core inverse in a ring

The notion of the weighted core inverse in a ring with involution was introduced, recently [Mosic et al. Comm. Algebra, 2018; 46(6); 2332-2345]. In this paper, we explore new representation and characterization of the weighted core inverse of sum and difference of two weighted core invertible elements in an unital ring with involution under different conditions. Further, we discuss reverse order laws and mixed-type reverse order laws for the weighted core invertible elements in a ring.

preprint2020arXiv

Weighted Moore-Penrose inverses of arbitrary-order tensors

Within the field of multilinear algebra, inverses and generalized inverses of tensors based on the Einstein product have been investigated over the past few years. In this paper, we explore the singular value decomposition and full-rank decomposition of arbitrary-order tensors using {\it reshape} operation. Applying range and null space of tensors along with the reshape operation; we further study the Moore-Penrose inverse of tensors and their cancellation properties via the Einstein product. Then we discuss weighted Moore-Penrose inverses of arbitrary-order tensors using such product. Following a specific algebraic approach, a few characterizations and representations of these inverses are explored. In addition to this, we obtain a few necessary and sufficient conditions for the reverse-order law to hold for weighted Moore-Penrose inverses of arbitrary-order tensors.

preprint2019arXiv

Further results on the Drazin inverse of even-order tensors

The notion of the Drazin inverse of an even-order tensor with the Einstein product was introduced, very recently [J. Ji and Y. Wei. Comput. Math. Appl., 75(9), (2018), pp. 3402-3413]. In this article, we further elaborate this theory by producing a few characterizations of the Drazin inverse and the W-weighted Drazin inverse of tensors. In addition to these, we compute the Drazin inverse of tensors using different types of generalized inverses and full rank decomposition of tensors. We also address the solution to the multilinear systems using the Drazin inverse and iterative (higher order Gauss-Seidel) method of tensors. Besides this, the convergence analysis of the iterative technique is also investigated within the framework of the Einstein product.

preprint2019arXiv

Generalized Inverses of Boolean Tensors via Einstein Product

Applications of the theory and computations of boolean matrices are of fundamental importance to study a variety of discrete structural models. But the increasing ability of data collection systems to store huge volumes of multidimensional data, the boolean matrix representation of data analysis is not enough to represent all the information content of the multiway data in different fields. From this perspective, it is appropriate to develop an infrastructure that supports reasoning about the theory and computations. In this paper, we discuss the generalized inverses of the Boolean tensors with the Einstein product. Further, we elaborate on this theory by producing a few characterizations of different generalized inverses and several equivalence results on boolean tensors. In addition to these, we define the rank of a boolean tensor through space decomposition.