Polynomial Basis Functions Research Articles

Orthonormalization of a Subset of Bernstein Polynomial Basis Functions

An explicit formula for an orthornomalized subset Bernstein polynomial basis is derived in order to solve linear boundary value problems with Dirichlet conditions via the Galerkin method.

Adaptive fractional physics-informed neural networks for solving forward and inverse problems of anomalous heat conduction in functionally graded materials

In this paper, adaptive fractional physics-informed neural networks (PINNs) are employed to solve the forward and inverse problems of anomalous heat conduction in three-dimensional functionally graded materials. In adaptive fractional PINNs, the finite difference L1 scheme is employed to discretize the time fractional derivatives in anomalous heat conduction problems. By combining the finite difference L1 scheme with automatic differentiation technique, adaptive fractional PINNs minimize a loss function constructed based on the governing equation, initial and boundary conditions to obtain solutions to heat conduction problems. To avoid competition among various loss terms during the training process, an adaptive loss balancing algorithm is adopted to balance the interactions among different terms of the loss functions. In addition, polynomial basis functions are used to expand unknown functions characterizing material parameters or heat sources, aiming to enhance the performance of adaptive fractional PINNs in resolving inverse problems. Five numerical examples involving forward, inverse, and nonlinear problems related to anomalous heat conduction are carried out to demonstrate the feasibility and effectiveness of adaptive fractional PINNs.

Superconvergent spectral projection and multi-projection methods for nonlinear Fredholm integral equations

In this article, we apply Galerkin and multi-Galerkin methods based on Kumar Sloan technique using Legendre polynomial basis functions for approximating the nonlinear Fredholm Hammerstein integral equations with the smooth kernels as well as the weakly singular algebraic and logarithmic kernels. We show that we are getting the improved superconvergence rates for Galerkin and multi-Galerkin methods based on Kumar Sloan technique without the need for the iterated Galerkin and the iterated multi-Galerkin methods. Infact without going to the iterated versions, we obtain the superconvergence rates equal to the convergence rates of iterated Galerkin and iterated multi-Galerkin methods. Theoretical results have been illustrated with numerical experiments.

A Kernel-Based Calibration Algorithm for Chromatic Confocal Line Sensors.

In chromatic confocal line sensors, calibration is usually divided into peak extraction and wavelength calibration. In previous research, the focus was mainly on peak extraction. In this paper, a kernel-based algorithm is proposed to deal with wavelength calibration, which corresponds to the mapping relationship between peaks (i.e., the wavelengths) in image space and profiles in physical space. The primary component of the mapping function is depicted using polynomial basis functions, which are distinguished along various dispersion axes. Considering the unknown distortions resulting from field curvature, sensor fabrication and assembly, and even the inherent complexity of dispersion, a typical kernel trick-based nonparametric function element is introduced here, predicated on the notion that similar processes conducted on the same sensor yield comparable distortions.To ascertain the performance with and without the kernel trick, we carried out wavelength calibration and groove fitting on a standard groove sample processed via glass grinding and with a reference depth of 66.14 μm. The experimental results show that depths calculated by the kernel-based calibration algorithm have higher accuracy and lower uncertainty than those ascertained using the conventional polynomial algorithm. As such, this indicates that the proposed algorithm provides effective improvements.

Semiparametric maximum likelihood reconstruction of stochastic differential equations driven by white and correlated noise.

A semiparametric methodology for reconstructing Markovian and non-Markovian Langevin equations from time series data using unscented Kalman filtering is introduced and explored. The drift function and the logarithm of the diffusion function are expanded into sets of polynomial basis functions. In contrast to the more common state augmentation approach, the Kalman filter is here used only for state estimation and propagation; the model parameters are determined by maximum likelihood based on the predictive distribution generated by the Kalman filter. Model selection regarding the number of included drift and diffusion basis functions is performed with the Bayesian information criterion. The method is successfully validated on various simulated datasets with known system dynamics; it achieves accurate identification of drift and diffusion functions, also outside the prescribed model class, from datasets of moderate length with medium computational cost.

Spectral integrated neural networks (SINNs) for solving forward and inverse dynamic problems

This study introduces an innovative neural network framework named spectral integrated neural networks (SINNs) to address both forward and inverse dynamic problems in three-dimensional space. In the SINNs, the spectral integration technique is utilized for temporal discretization, followed by the application of a fully connected neural network to solve the resulting partial differential equations in the spatial domain. Furthermore, the polynomial basis functions are employed to expand the unknown function, with the goal of improving the performance of SINNs in tackling inverse problems. The performance of the developed framework is evaluated through several dynamic benchmark examples encompassing linear and nonlinear heat conduction problems, linear and nonlinear wave propagation problems, inverse problem of heat conduction, and long-time heat conduction problem. The numerical results demonstrate that the SINNs can effectively and accurately solve forward and inverse problems involving heat conduction and wave propagation. Additionally, the SINNs provide precise and stable solutions for dynamic problems with extended time durations. Compared to commonly used physics-informed neural networks, the SINNs exhibit superior performance with enhanced convergence speed, computational accuracy, and efficiency.

A new space–time localized meshless method based on coupling radial and polynomial basis functions for solving singularly perturbed nonlinear Burgers’ equation

In this paper, the singularly perturbed nonlinear Burgers’ problem (SPBP) with small kinematic viscosity 0<ϵ≪1 is solved using a new Space–Time Localized collocation method based on coupling Polynomial and Radial Basis Functions (STLPRBF). To our best knowledge, it is the first time that the solution of SPBP is accurately approximated using the space–time meshless method without applying any adaptive refinement technique. The method is based on solving the problem without distinguishing between space and time variables, which eliminates the need for time discretization schemes. To address the inherent non-linearity of the problem, the method employs an iterative algorithm based on quasilinearization technique. The efficiency and accuracy of the proposed method are demonstrated by solving different examples of one- and two-dimensional SPBP with very small ϵ up to 10−10. Additionally, the numerical convergence of the method with respect to ϵ and also to the number of collocation points has been investigated. The comparison of the STLPRBF results with other published ones is presented.

Numerical analysis for nonlinear wave equations with boundary conditions: Dirichlet, Acoustics and Impenetrability

In this article, we present an error estimation in the L2 norm referring to three wave models with variable coefficients, supplemented with initial and boundary conditions. The first two models are nonlinear wave equations with Dirichlet, Acoustics, and nonlinear dissipative impenetrability boundary conditions, while the third model is a linear wave equation with Dirichlet, Acoustics, and linear dissipative impenetrability boundary conditions. In the field of numerical analysis, we establish two key theorems for estimating errors to the semi-discrete and totally discrete problems associated with each model. Such theorems provide theoretical results on the convergence rate in both space and time. For conducting numerical simulations, we employ linear, quadratic, and cubic polynomial basis functions for the finite element spaces in the Galerkin method, in conjunction with the Crank-Nicolson method for time discretization. For each time step, we apply Newton's method to the resulting nonlinear problem. The numerical results are presented for all three models in order to corroborate with the theoretical convergence order obtained.

E-PINN: extended physics informed neural network for the forward and inverse problems of high-order nonlinear integro-differential equations

Physics informed neural network (PINN) is a new deep learning paradigm, which embeds the physical information delineated by PDEs in the loss function and optimizes the weights in the neural network. Based on PINN, an extended PINN(E-PINN) is proposed, which is a mixture of the polynomial function approximation method and PINN's learning framework. A preprocess layer is added before the classical PINN, using Legendre polynomials as the polynomial basis function. Therefore, E-PINN not only has the excellent approximation ability of the polynomial basis function, but also inherits the learning framework of the neural network method. In numerical experiments, the proposed E-PINN algorithms have high accuracy in solving 1D, 2D high-order nonlinear Fredholm equations and equations system, including the forward and inverse problems.

Orthonormal discrete Legendre polynomials for stochastic distributed‐order time‐fractional fourth‐order delay sub‐diffusion equation

In this study, the stochastic distributed‐order time‐fractional version of the fourth‐order delay sub‐diffusion equation is defined by employing the Caputo fractional derivative. The orthonormal discrete Legendre polynomials, as a well‐known family of discrete polynomials basis functions, are used to develop a numerical method to solve this equation. To employ these polynomials in constructing the expressed approach, the operational matrices of the classical integration, differentiation (ordinary, fractional and distributed‐order fractional), and stochastic integration of these polynomials are extracted. The established method turns solving the introduced stochastic‐fractional equation into solving a more simple linear algebraic system of equations. In fact, by representing the unknown solution in terms of the introduced polynomials and employing the extracted matrices, this system is obtained. The accuracy of the developed algorithm is numerically checked by solving two examples.

Ritz Variational Method for the Analysis of Thin Rectangular Plate Bending Problems with Adjacent Edges Clamped and Simply Supported Using the Super position of Trigonometric Series and Polynomial Basis Functions

Ritz Variational Method for the Analysis of Thin Rectangular Plate Bending Problems with Adjacent Edges Clamped and Simply Supported Using the Super position of Trigonometric Series and Polynomial Basis Functions

A Pressure Projection Scheme With Near‐Spectral Accuracy for Nonhydrostatic Flow in Domains With Open Boundaries

AbstractWe describe a pressure projection scheme for the simulation of incompressible flow in cubic domains with open boundaries based on fast Fourier transforms. The scheme is implemented in flow_solve, a numerical code designed for process studies of rotating, density‐stratified flow. The main algorithmic features of the open‐boundary code are the near‐spectral accuracy of the discrete differentiation and a dynamic two‐dimensional domain decomposition that scales efficiently to large numbers of processors. The simulated flows are not required to be periodic or to satisfy symmetry conditions at the open boundaries owing to the use of mixed series expansions combining cosine and singular Bernoulli polynomial basis functions. These expansions facilitate the imposition of inhomogeneous boundary conditions and allow the code to be used for offline, one‐way nesting within an arbitrarily embedded subdomain of a larger scale simulation. The projection scheme is designed to exploit a simple and powerful numerical engine: inversion of Poisson's equation with homogeneous Neumann boundary conditions using fast cosine transforms. Here, we describe the mathematical transformations used to accommodate the imposition of space‐ and time‐varying boundary conditions. The utility of the approach for process studies and for nesting within submesoscale‐resolving ocean models is demonstrated with simulations of wind‐driven near‐inertial waves in the upper ocean.

Efficient MAPoD via Least Angle Regression based Polynomial Chaos Expansion Metamodel for Eddy Current NDT

In this article, a metamodeling approach based on non-intrusive polynomial chaos expansion (PCE) with least angle regression (LAR) method is used in boundary element analysis for a model-assisted probability of detection (MAPoD) study of eddy current nondestructive testing (NDT) systems. The LAR-PCE metamodel represents the NDT system model responses by a set of coefficients with the polynomial basis functions in lieu of pure kernel degeneration accelerated boundary element method (KD-BEM) based physical model. Both the computational accuracy and efficiency of the LAR-PCE metamodel over the ordinary least squares (OLS) based PCE metamodel are demonstrated by testing the 3D eddy current NDT benchmarks with different system setups, flaw lengths and widths. The simulation results show two digits accuracy of the PoD metrics compared with the ones achieved by the KD-BEM based physical model as the benchmark. The LAR-PCE metamodel has remarkable improvements in computational efficiency over the OLS-PCE metamodel and accelerates the MAPoD study.

Meshfree RBF–FD methods for numerical simulation of PDE problems

The meshfree RBF–FD method is becoming an increasingly popular discretization method for challenging PDE problems due to its flexibility with respect to geometry and its ease of implementation. Using a combination of polyharmonic spline basis functions and polynomial basis functions has proven to be particularly successful with a convergence rate depending on the polynomial degree and good behavior at boundaries due to the contribution of the spline part. A challenge that has been observed is that derivative boundary conditions can give rise to large errors. A known remedy for this problem is to introduce one or more layers of ghost points, which improves the boundary approximations. In a recent paper, Tominec, Larsson, Heryudono (2021), it was shown that using oversampling is another effective way to handle this problem. Oversampling also allows for theoretical analysis of the method, which can then be viewed as a discretization of a continuous least-squares projection. By looking deeper into the error estimates we gain an understanding about how to best implement the method.

Positivity-preserving discontinuous Galerkin scheme for linear hyperbolic equations with characteristics-informed augmentation

This paper presents a positivity-preserving discontinuous Galerkin (DG) scheme for the linear hyperbolic problem with variable coefficients on structured Cartesian domains. The standard DG spaces are augmented with either polynomial or non-polynomial basis functions. The primary purpose of these augmented basis functions is to ensure that the cell average from the unmodulated DG scheme remains positive. We explicitly obtain suitable basis functions by inspecting the method of characteristics on an auxiliary problem. A key result is proved which demonstrates that the unmodulated augmented DG scheme will retain a positive cell average, provided that the inflow, source term, and variable coefficients are positive. A simple scaling limiter can then be leveraged to produce a high-order conservative positivity-preserving DG scheme. Numerical experiments demonstrate the scheme is able to retain high-order accuracy as well as robustness for variable coefficients. To improve efficiency, an inexact augmented basis function can be obtained rather than a analytic non-polynomial solution to the auxiliary problem from the method of characteristics.

A framework for performance enhancement of classifiers in detection of prostate cancer from microarray gene

Prostate cancer is a major world health problem for men. This shows how important early detection and accurate diagnosis are for better treatment and patient outcomes. This study compares different ways to find Prostate Cancer (PCa) and label tumors as normal or abnormal, with the goal of speeding up current work in microarray gene data analysis. The study looks at how well several feature extraction methods work with three feature selection strategies: Harmonic Search (HS), Firefly Algorithm (FA), and Elephant Herding Optimization (EHO). The techniques tested are Expectation Maximization (EM), Nonlinear Regression (NLR), K-means, Principal Component Analysis (PCA), and Discrete Cosine Transform (DCT). Eight classifiers are used for the task of classification. These are Random Forest, Decision Tree, Adaboost, XGBoost, and Support Vector Machine (SVM) with linear, polynomial, and radial basis function kernels. This study looks at how well these classifiers work with and without feature selection methods. It finds that the SVM with radial basis function kernel, using DCT for feature extraction and EHO for feature selection, does the best of all of them, with an accuracy of 94.8 % and an error rate of 5.15 %.

Digital Self-Interference Canceler with Joint Channel Estimator for Simultaneous Transmit and Receive System.

Simultaneous transmit and receive wireless communications have been highlighted for their potential to double the spectral efficiency. However, it is necessary to mitigate self-interference (SI). Considering both the SI channel and remote transmission (RT) channel need to be estimated before equalizing the received signal, we propose two adaptive algorithms for linear and nonlinear self-interference cancellation (SIC), based on a multi-layered joint channel estimator structure. The proposed algorithms estimate the RT channel while performing SIC, and the multi-layered structure ensures improved performance across various interference-to-signal ratios. The M-estimate function enhances the robustness of the algorithm, allowing it to converge even when affected by impulsive noise. For nonlinear SIC, this paper introduces an adaptive algorithm based on generalized Hammerstein polynomial basis functions. The simulation results indicate that this approach achieves a better convergence speed and normalized mean squared difference compared to existing SIC methods, leading to a lower system bit error rate.

TriKSV-LG: a robust approach to disease prediction in healthcare systems using AI and Levy Gazelle optimization

A seamless connection between the Internet and people is provided by the Internet of Things (IoT). Furthermore, lives are enhanced using the integration of the cloud layer. In the healthcare domain, a reactive healthcare strategy is turned into a proactive one using predictive analysis. The challenges faced by existing techniques are inaccurate prediction and a time-consuming process. This paper introduces an Artificial Intelligence (AI) and IoT-based disease prediction method, the TriKernel Support Vector-based Levy Gazelle (TriKSV-LG) Algorithm, which aims to improve accuracy, and reduce the time of predicting diseases (kidney and heart) in healthcare systems. The IoT sensors collect information about patients’ health conditions, and the AI employs the information in disease prediction. TriKSV utilizes multiple kernel functions, including linear, polynomial, and radial basis functions, to classify features more effectively. By learning from different representations of the data, TriKSV better handles variations and complexities within the dataset, leading to more robust disease prediction models. The Levy Flight strategy with Gazelle optimization algorithm tunes the hyperparameters and balances the exploration and exploitation for optimal hyperparameter configurations in predicting chronic kidney disease (CKD) and heart disease (HD). Furthermore, TriKSV's incorporation of multiple kernel functions, combined with the Gazelle optimization strategy, helps mitigate overfitting by providing a more comprehensive search space for optimal hyperparameter selection. The proposed TriKSV-LG method is applied to two different datasets, namely the CKD dataset and the HD dataset, and evaluated using performance measures such as AUC-ROC, specificity, F1-score, recall, precision, and accuracy. The results demonstrate that the proposed TriKSV-LG method achieved an accuracy of 98.56% in predicting kidney disease using the CKD dataset and 98.11% accuracy in predicting HD using the HD dataset.

Spatial Functional Data analysis: Irregular spacing and Bernstein polynomials

Spatial Functional Data (SFD) analysis is an emerging statistical framework that combines Functional Data Analysis (FDA) and spatial dependency modeling. Unlike traditional statistical methods, which treat data as scalar values or vectors, SFD considers data as continuous functions, allowing for a more comprehensive understanding of their behavior and variability. This approach is well-suited for analyzing data collected over time, space, or any other continuous domain. SFD has found applications in various fields, including economics, finance, medicine, environmental science, and engineering. This study proposes new functional Gaussian models incorporating spatial dependence structures, focusing on irregularly spaced data and reflecting spatially correlated curves. The model is based on Bernstein polynomial (BP) basis functions and utilizes a Bayesian approach for estimating unknown quantities and parameters. The paper explores the advantages and limitations of the BP model in capturing complex shapes and patterns while ensuring numerical stability. The main contributions of this work include the development of an innovative model designed for SFD using BP, the presence of a random effect to address associations between irregularly spaced observations, and a comprehensive simulation study to evaluate models’ performance under various scenarios. The work also presents one real application of Temperature in Mexico City, showcasing practical illustrations of the proposed model.

Prediction-Based Power Consumption Monitoring of Industrial Equipment Using Interpretable Data-Driven Models

Efficient energy optimization and scheduling in industrial factories depend on accurate, reasonable, and real-time monitoring of equipment power consumption. However, the power prediction of industrial equipment requires a large number of process data, which could be inevitably contaminated by some imperfect data, due to the harsh environments. Monitoring or predicting equipment power consumption is usually not feasible using data-driven black-box models with imperfect data. This paper proposes a prediction-based approach for power consumption monitoring using an interpretable data-driven model. First, a data preprocessing method is used to remove outliers and fill in missing values. Then, a Volterra polynomial basis function (VPBF) model is built to predict equipment power consumption. This model decomposes power values into a series of basis functions consisting of input parameters. Moreover, to compensate for data dropouts during the power consumption monitoring process, a networked predictive monitoring system is also proposed. Finally, this paper presents two case studies based on actual production equipment in an industrial manufacturing factory. The results demonstrate that the proposed approach can achieve satisfactory monitoring accuracy and adaptation ability. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Note to Practitioners</i> —This paper is motivated by the problem of power consumption monitoring of industrial equipment in harsh production environments. A conventional solution is to predict the power consumption using data-driven black-box models, with limited feasibility and interpretability. This paper proposes a new power consumption monitoring approach, utilizing an interpretable data-driven model and a networked predictive method. This approach accurately reveals the transparent relationships between the output and input parameters. The power prediction result is consequently interpretable and more reasonable. Meanwhile, this approach actively compensates for data dropouts in the network, which can help operators real-time grasp the power consumption of equipment. Furthermore, this approach can be integrated into energy optimization systems as a basis of optimization and decision-making. Practical applications in an aluminum manufacturing company located in Guangdong Province demonstrate that this approach is feasible and applicable. Future research is to expand this approach further for energy optimization and scheduling.