SearcharxivSearch

arXiv subjects

Ratikanta Behera

Publications and source records attributed to Ratikanta Behera.

At least 19 recordsLinked to original sources

LiNO: Lifting based multiresolution neural operator

Recently, neural operators have shown promising outcomes for learning solution operators of differential equations directly from data. This framework learns a functional mapping from the parameter field to the solution field, enabling the prediction of an entire class of solutions rather than a specific instance. However, existing operators often struggle to capture both global dynamics and fine-scale structure simultaneously. To design an effective operator capable of representing multiscale features, a hierarchical multiscale decomposition framework is required. In this study, we develop the Lifting Neural Operator (LiNO), a multiresolution operator built on the second-generation wavelet lifting scheme. LiNO learns a multiresolution decomposition directly from data by parameterizing the lifting transform. This lifting transformation is adaptive to the underlying solution function and exactly invertible by construction, enabling information-preserving multiscale operator learning. In the lifted multiresolution space, the operator evolves coarse and directional detail coefficients separately, resulting in scale-aware modeling of the underlying physics. We evaluate LiNO on several benchmarks, including Darcy flow, the Poisson equation, the Allen-Cahn equation, the compressible Navier-Stokes equation, and the Gray-Scott reaction-diffusion system. Together, these benchmarks cover a wide range of physical behaviors, including multiscale phenomena, transport-dominated dynamics, and chaotic systems. LiNO demonstrates strong performance on these challenging benchmarks compared with state-of-the-art neural operators. These results suggest that adaptive multiresolution operators provide a promising direction for scientific machine learning.

cs.LG

Quantum Physics-Informed Neural Networks for Solving Integro and Fractional PDEs

Quantum neural networks have emerged as powerful models for approximating nonlinear functions. Yet their use in solving integro-differential equations (IDEs) and fractional integro-partial differential equations (FIPDEs), which involve inherently nonlocal operators, remains unexplored. This work introduces a quantum physics-informed neural network (QPINN) framework that combines a quantum neural network with the governing equations of general nonlinear IDEs and FIPDEs. The proposed quantum network uses an affine feature map and variational quantum circuits to produce trial solutions with explicit trigonometric structure. We prove a quantitative $L^{2}(\mu)$ universal approximation theorem for this architecture, achieving a convergence rate of $\mathcal{O}(n^{-1/2})$. This extends classical Fourier approximation theory to quantum circuits for physics-informed learning. We propose two QPINN variants: the numerical-quadrature QPINN (N-QPINN), which handles nonlocal integrals and fractional operators via high-order numerical quadrature while computing local derivatives through automatic differentiation of quantum trial solutions; and the auxiliary-function QPINN (A-QPINN), which eliminates numerical quadrature by introducing auxiliary variables that reformulate each integro-differential equation as an equivalent coupled system of partial differential equations, enabling a multi-output quantum neural network to simultaneously represent the solution and its associated variables. A series of numerical experiments demonstrates that the proposed QPINN framework accurately captures the behavior of nonlinear IDEs and FIPDEs and outperforms classical physics-informed neural networks.

math.AP

A Family of Iterative Methods for Computing Generalized Inverses of Quaternion Matrices and its Applications

The computation of generalized inverses of quaternion matrices is a fundamental problem in quaternion linear algebra, with wide-ranging applications in signal processing, image restoration, and multidimensional data analysis. This paper presents three efficient quaternion iterative algorithms for computing the Moore-Penrose pseudoinverse: (i) the quaternion rapid iterative method (QRAPID), (ii) the quaternion strong approximate inverse (QSAI), and (iii) the quaternion hyperpower iterative method of order nineteen (QHPI19). Convergence theorems and perturbation bounds are established to ensure numerical stability and robustness. The QSAI method is further employed as a preconditioner for quaternion Krylov subspace solvers, resulting in substantial reductions in the iteration count and runtime for large-scale linear systems. Comprehensive numerical experiments demonstrate that the proposed algorithms achieve an accuracy comparable to or better than existing approaches, including quaternion SVD, quaternion Newton-Schulz, and classical hyperpower schemes, while offering significant computational savings. The practical utility of the framework is illustrated through two representative applications: image completion via CUR decomposition and signal filtering, which confirm its scalability and effectiveness in real-world multidimensional data applications.

math.NA

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.

math.OC

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.

cs.LG

Robust Low-Rank Tensor Completion based on M-product with Weighted Correlated Total Variation and Sparse Regularization

The robust low-rank tensor completion problem addresses the challenge of recovering corrupted high-dimensional tensor data with missing entries, outliers, and sparse noise commonly found in real-world applications. Existing methodologies have encountered fundamental limitations due to their reliance on uniform regularization schemes, particularly the tensor nuclear norm and $\ell_1$ norm regularization approaches, which indiscriminately apply equal shrinkage to all singular values and sparse components, thereby compromising the preservation of critical tensor structures. The proposed tensor weighted correlated total variation (TWCTV) regularizer addresses these shortcomings through an $M$-product framework that combines a weighted Schatten-$p$ norm on gradient tensors for low-rankness with smoothness enforcement and weighted sparse components for noise suppression. The proposed weighting scheme adaptively reduces the thresholding level to preserve both dominant singular values and sparse components, thus improving the reconstruction of critical structural elements and nuanced details in the recovered signal. Through a systematic algorithmic approach, we introduce an enhanced alternating direction method of multipliers (ADMM) that offers both computational efficiency and theoretical substantiation, with convergence properties comprehensively analyzed within the $M$-product framework.Comprehensive numerical evaluations across image completion, denoising, and background subtraction tasks validate the superior performance of this approach relative to established benchmark methods.

stat.ML

A hybrid wavelet-based physics-informed neural network for portfolio management

In this paper, we present a Hybrid Wavelet-based Physics-Informed Neural Networks (HW-PINNs) framework for portfolio management that provides a promising alternative to Physics-Informed Neural Networks (PINNs). Here, we first discuss the generalized framework of the Merton jump diffusion model and the associated HW-PINNs, followed by the one-dimensional case of a European option. Our work adapts the HW-PINN framework to the Merton jump-diffusion model for a European option, using a simplified direct coefficient optimization strategy, a mathematically corrected log-space formulation, and an efficient FFT -based computation of the integro-differential operator. Through numerical experiments across realistic market scenarios, we show that our proposed model achieves high accuracy and robustness, with a mean relative error of 0.27\% in low jump intensity scenarios compared to high-fidelity benchmarks. Our results validate that the implementation of this specific HW-PINN framework is a computationally efficient and reliable tool for pricing derivatives in markets with high jump risk. In addition, we further discuss risk analysis using Value at Risk (VaR) and Conditional Value at Risk (CVaR), which provide insights into downside risk across different market scenarios.

math.OC

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.

math.NA

Wavelet-Accelerated Physics-Informed Quantum Neural Network for Multiscale Partial Differential Equations

This work proposes a wavelet-based physics-informed quantum neural network framework to efficiently address multiscale partial differential equations that involve sharp gradients, stiffness, rapid local variations, and highly oscillatory behavior. Traditional physics-informed neural networks (PINNs) have demonstrated substantial potential in solving differential equations, and their quantum counterparts, quantum-PINNs, exhibit enhanced representational capacity with fewer trainable parameters. However, both approaches face notable challenges in accurately solving multiscale features. Furthermore, their reliance on automatic differentiation for constructing loss functions introduces considerable computational overhead, resulting in longer training times. To overcome these challenges, we developed a wavelet-accelerated physics-informed quantum neural network that eliminates the need for automatic differentiation, significantly reducing computational complexity. The proposed framework incorporates the multiresolution property of wavelets within the quantum neural network architecture, thereby enhancing the network's ability to effectively capture both local and global features of multiscale problems. Numerical experiments demonstrate that our proposed method achieves superior accuracy while requiring less than five percent of the trainable parameters compared to classical wavelet-based PINNs, resulting in faster convergence. Moreover, it offers a speedup of three to five times compared to existing quantum PINNs, highlighting the potential of the proposed approach for efficiently solving challenging multiscale and oscillatory problems.

cs.LG

RGDBEK: Randomized Greedy Double Block Extended Kaczmarz Algorithm with Hybrid Parallel Implementation and Applications

Kaczmarz is one of the most prominent iterative solvers for linear systems of equations. Despite substantial research progress in recent years, the state-of-the-art Kaczmarz algorithms have not fully resolved the seesaw effect, a major impediment to convergence stability. Furthermore, while there have been advances in parallelizing the inherently sequential Kaczmarz method, no existing architecture effectively supports initialization-independent parallelism that fully leverages both CPU and GPU resources. This paper proposes the Randomized Greedy Double Block Extended Kaczmarz (RGDBEK) algorithm, a novel Kaczmarz approach designed for efficient large-scale linear system solutions. RGDBEK employs a randomized selection strategy for column and row blocks based on residual-derived probability distributions, thereby mitigating the traditional seesaw effect and enhancing convergence robustness. Theoretical analysis establishes linear convergence of the method under standard assumptions. Extensive numerical experiments on synthetic random matrices and real-world sparse matrices from the SuiteSparse collection demonstrate that RGDBEK outperforms existing Kaczmarz variants, including GRK, FDBK, FGBK, and GDBEK, in both iteration counts and computational time. In addition, a hybrid parallel CPU-GPU implementation utilizing optimized sparse matrix-vector multiplications via the state-of-the-art storage format improves scalability and performance on large sparse problems. Applications in finite element discretizations, image deblurring, and noisy population modeling demonstrate the algorithm's versatility and effectiveness. Future work will explore extending RGDBEK to tensor systems, optimizing parallel parameter selection, and reducing communication overhead to further enhance efficiency and applicability.

math.NA

Structure Preserving Algorithms for Quaternion Outer Inverses with Applications

This study investigates the theoretical and computational aspects of quaternion generalized inverses, focusing on outer inverses and {1,2}-inverses with prescribed range and/or null space constraints. In view of the non-commutative nature of quaternions, a detailed characterization of the left and right range and null spaces of quaternion matrices is presented. Explicit representations for these inverses are derived, including full rank decomposition-based formulations. We design two efficient algorithms: one leveraging the Quaternion Toolbox for MATLAB (QTFM), and the other employing a complex structure preserving approach based on the complex representation of quaternion matrices. With suitable choices of subspace constraints, these outer inverses unify and generalize several classical inverses, including the Moore-Penrose inverse, the group inverse, and the Drazin inverse. The proposed methods are validated through numerical examples and applied to two real-world tasks: quaternion-based color image deblurring, which preserves inter-channel correlations, and robust filtering of chaotic 3D signals, demonstrating their effectiveness in high-dimensional settings.

math.RA

Two-step parameterized tensor-based iterative methods for solving $\mathcal{A}_{*M}\mathcal{X}_{*M}\mathcal{B}=\mathcal{C}$

Iterative methods based on tensors have emerged as powerful tools for solving tensor equations, and have significantly advanced across multiple disciplines. In this study, we propose two-step tensor-based iterative methods to solve the tensor equations $\mathcal{A}_{*M}\mathcal{X}_{*M}\mathcal{B}=\mathcal{C}$ by incorporating preconditioning techniques and parametric optimization to enhance convergence properties. The theoretical results were complemented by comprehensive numerical experiments that demonstrated the computational efficiency of the proposed two-step parametrized iterative methods. The convergence criterion for parameter selection has been studied and a few numerical experiments have been conducted for optimal parameter selection. Effective algorithms were proposed to compute iterative methods based on two-step parameterized tensors, and the results are promising. In addition, we discuss the solution of the Sylvester equations and a regularized least-squares solution for image deblurring problems.

math.NA

An efficient wavelet-based physics-informed neural network for multiscale problems

Physics-informed neural networks (PINNs) are a class of deep learning models that utilize physics in the form of differential equations to address complex problems, including those with limited data availability. However, solving differential equations with rapid oscillations, steep gradients, or singular behavior remains challenging for PINNs. To address this, we propose an efficient wavelet-based physics-informed neural network (W-PINN) that learns solutions in wavelet space. Here, we represent the solution using localized wavelets. This framework represents the solution of a differential equation with significantly fewer degrees of freedom while retaining the dynamics of complex physical phenomena. The proposed architecture enables training to search for solutions within the wavelet domain, where multiscale characteristics are less pronounced compared to the physical domain. This facilitates more efficient training for such problems. Furthermore, the proposed model does not rely on automatic differentiation for derivatives in the loss function and does not require prior information regarding the behavior of the solution, such as the location of abrupt features. The removal of AD significantly reduces training time while maintaining accuracy. Thus, through a strategic fusion of wavelets with PINNs, W-PINNs capture localized nonlinear information, making them well-suited for problems with abrupt behavior, such as singularly perturbed and other multiscale problems. We further analyze the convergence behavior of W-PINN through a comparative study using Neural Tangent Kernel theory. The efficiency and accuracy of the proposed model are demonstrated across various problems, including the FitzHugh--Nagumo (FHN) model, Helmholtz equation, Maxwell equation, Allen--Cahn equation, and lid-driven cavity flow, along with other highly singularly perturbed nonlinear differential equations.

cs.LG

Computation of $M$-QDR decomposition of tensors and applications

The theory and computation of tensors with different tensor products play increasingly important roles in scientific computing and machine learning. Different products aim to preserve different algebraic properties from the matrix algebra, and the choice of tensor product determines the algorithms that can be directly applied. This study introduced a novel full-rank decomposition and $M$-$\mc{QDR}$ decomposition for third-order tensors based on $M$-product. Then, we designed algorithms for computing these two decompositions along with the Moore-Penrose inverse, and outer inverse of the tensors. In support of these theoretical results, a few numerical examples were discussed. In addition, we derive exact expressions for the outer inverses of tensors using symbolic tensor (tensors with polynomial entries) computation. We designed efficient algorithms to compute the Moore-Penrose inverse of symbolic tensors. The prowess of the proposed $M$-$\mc{QDR}$ decomposition for third-order tensors is applied to compress lossy color images.

math.NA

$M$-QR decomposition and hyperpower iterative methods for computing outer inverses of tensors

The outer inverse of tensors plays increasingly significant roles in computational mathematics, numerical analysis, and other generalized inverses of tensors. In this paper, we compute outer inverses with prescribed ranges and kernels of a given tensor through tensor QR decomposition and hyperpower iterative method under the M-product structure, which is a family of tensor-tensor products, generalization of the t-product and c-product, allows us to suit the physical interpretations across those different modes. We discuss a theoretical analysis of the nineteen-order convergence of the proposed tensor-based iterative method. Further, we design effective tensor-based algorithms for computing outer inverses using M-QR decomposition and hyperpower iterative method. The theoretical results are validated with numerical examples demonstrating the appropriateness of the proposed methods.

math.NA

Computation of tensors generalized inverses under $M$-product and applications

This paper introduces notions of the Drazin and the core-EP inverses on tensors via M-product. We propose a few properties of the Drazin and core-EP inverses of tensors, as well as effective tensor-based algorithms for calculating these inverses. In addition, definitions of composite generalized inverses are presented in the framework of the M-product, including CMP, DMP, and MPD inverse of tensors. Tensor-based higher-order Gauss-Seidel and Gauss-Jacobi iterative methods are designed. Algorithms for these two iterative methods to solve multilinear equations are developed. Certain multilinear systems are solved using the Drazin inverse, core-EP inverses, and composite generalized inverses such as CMP, DMP, and MPD inverse. A tensor M-product-based regularization technique is applied to solve the color image deblurring.

math.NA

Characterizations of Weighted Generalized Inverses

The main objective of this paper is to introduce unique representations and characterizations for the weighted core inverse of matrices. We also investigate various properties of these inverses and their relationships with other generalized inverses. Proposed representations of the matrix-weighted core inverse will help us to discuss some results associated with the reverse order law for these inverses. Furthermore, this paper introduces an extension of the concepts of generalized bilateral inverse and $\{1,2,3,1^k\}$-inverse and their respective dual for complex rectangular matrices. Furthermore, we establish characterizations of EP-ness and the condition when both $W$-weighted $\{1,2,3\}$ and $W$-weighted $\{1,2,3,1^k\}$ inverses coincide. Then, a W-weighted index-MP, W-weighted MP-index, and W-weighted MP-index-MP matrices for rectangular complex matrices is introduced. In addition, we define the dual inverses for both weighted bilateral inverses and $\{1,2,3,1^k\}$-inverse. Characteristics that lead to self-duality in weighted bilateral inverses are also examined.

math.NA

Computation of outer inverse of tensors based on $t$-product

Tensor operations play an essential role in various fields of science and engineering, including multiway data analysis. In this study, we establish a few basic properties of the range and null space of a tensor using block circulant matrices and the discrete Fourier matrix. We then discuss the outer inverse of tensors based on $t$-product with a prescribed range and kernel of third-order tensors. We address the relation of this outer inverse with other generalized inverses, such as the Moore-Penrose inverse, group inverse, and Drazin inverse. In addition, we present a few algorithms for computing the outer inverses of the tensors. In particular, a $t$-QR decomposition based algorithm is developed for computing the outer inverses.

math.NA