Search

This paper explores the application of Random Matrix Theory (RMT) as a methodological enhancement for portfolio selection within financial markets. Traditional approaches to portfolio optimization often rely on historical estimates of correlation matrices, which are particularly susceptible to instabilities. To address this challenge, we combine a data preprocessing technique based on the Hilbert transformation of returns with RMT to refine the accuracy and robustness of correlation matrix estimation. By comparing empirical correlations with those generated through RMT, we reveal non-random properties and uncover underlying relationships within financial data. We then utilize this methodology to construct the correlation network dependence structure used in portfolio optimization. The empirical analysis presented in this paper validates the effectiveness of RMT in enhancing portfolio diversification and risk management strategies. This research contributes by offering investors and portfolio managers with methodological insights to construct portfolios that are more stable, robust, and diversified. At the same time, it advances our comprehension of the intricate statistical principles underlying multivariate financial data. [ABSTRACT FROM AUTHOR]

This paper investigates the adaptive neural network (NN) tracking control problem for stochastic nonlinear systems with multiple actuator constraints and full-state constraints. The issue of system full-state constraints is tackled by a generalized barrier Lyapunov function (GBLF), and the output constraints of the system are considered to be in the form of time-varying functions, which are more in line with the needs of real physical systems. The NN approximation technique is utilized to overcome the influence of the uncertainty term on controller design due to randomness. Based on the backstepping technique, a neural adaptive fixed-time tracking control strategy is designed. Under the designed control strategy, the tracking accuracy of the controlled system can reach the expectation in a fixed time. The multi-actuator constraints are converted into a generalized mathematical model to simplify the controller design process. Using the characteristics of the hyperbolic tangent function, a new function called practical virtual control signal is designed using the virtual control signal as the input. Due to the saturation constraint property of the hyperbolic tangent function, it is theoretically ensured that no state of the system exceeds the constraints through to the new form of the virtual controller. Using the adaptive controller constructed in this paper, the controlled system is semi-global fixed-time stabilized in probability (SGFSP). Finally, the effectiveness of the proposed control strategy is further verified by simulation examples. [ABSTRACT FROM AUTHOR]

The Solow residual method, traditionally pivotal for calculating total factor productivity (TFP), is typically not applied to green TFP calculations due to its exclusion of undesired outputs. Diverging from traditional approaches and other frontier methodologies such as Data Envelopment Analysis (DEA) and Stochastic Frontier Analysis (SFA), this paper integrates undesired outputs and three types of spatial spillover effects into the conventional Solow framework, thereby creating a new spatiotemporal econometric Solow residual method (STE-SRM). Utilizing this novel method, the study computes the industrial green TFPs for 280 Chinese cities from 2003 to 2019, recalculates these TFPs using DEA-SBM and Bayesian SFA for the same cities and periods, and assesses the accuracy of the STE-SRM-derived TFPs through comparative analysis. Additionally, the paper explores the statistical properties of China's urban industrial green TFPs as derived from the STE-SRM, employing Dagum's Gini coefficient and spatial convergence analyses. The findings first indicate that by incorporating undesired outputs and spatial spillover into the Solow residual method, green TFPs are computable in alignment with the traditional Solow logic, although the allocation of per capita inputs and undesired outputs hinges on selecting the optimal empirical production function. Second, China's urban industrial green TFPs, calculated using the STE-SRM with the spatial Durbin model with mixed effects as the optimal model, show that cities like Huangshan, Fangchenggang, and Sanya have notably higher TFPs, whereas Jincheng, Datong, and Taiyuan display lower TFPs. Third, comparisons of China's urban industrial green TFP calculations reveal that those derived from the STE-SRM demonstrate broader but more concentrated results, while Bayesian SFA results are narrower and less concentrated, and DEA-SBM findings sit between these extremes. Fourth, the study highlights significant spatial heterogeneity in China's urban industrial green TFPs across different regions—eastern, central, western, and northeast China—with evident sigma convergence across the urban landscape, though absolute beta convergence is significant only in a limited subset of cities and time periods. [ABSTRACT FROM AUTHOR]

When constructing an investment portfolio, it is important to maximize returns while minimizing risks. This portfolio optimization can be considered as a multi-objective optimization problem that is solved by means of multi-objective evolutionary algorithms. The use of multi-objective evolutionary algorithms (MOEAs) provides an effective approach for dealing with the complex data involved in multi-objective optimization problems. However, current MOEAs often rely on a single strategy to obtain optimal solutions, leading to premature convergence and an insufficient population diversity. In this paper, a new MOEA called the Synergistic MOEA with Diffusion Population Generation (DPG-SMOEA) is proposed to address these limitations by integrating MOEAs with diffusion models. To train the diffusion model, a mixed memory pool strategy is optimized, which collects improved solutions from the MOEA/D-AEE, an optimized MOEA, as training samples. The trained model is then used to generate offspring. Considering the cold-start mechanism of the diffusion model, particularly during the training phase where it is not suitable for generating initial offspring, this paper adjusts and optimizes the collaborative strategy to enhance the synergy between the diffusion model and MOEA/D-AEE. Experimental validation of the DPG-SMOEA demonstrates the advantages of using diffusion models in low-dimensional and relatively continuous data analysis. The results show that the DPG-SMOEA performs well on the low-dimensional Hang Seng Index test dataset, while achieving average performance on other high-dimensional datasets, consistent with theoretical predictions. Overall, the DPG-SMOEA achieves better results compared to MOEA/D-AEE and other multi-objective optimization algorithms. [ABSTRACT FROM AUTHOR]

With the increasing demand for road traffic safety assessment, global concerns about road safety have been rising. This is particularly evident with the widespread adoption of V2X (Vehicle-to-Everything) technology, where people are more intensively focused on how to leverage advanced technological means to effectively address challenges in traffic safety. Through the research of driving style recognition technology, accurate assessment of driving behavior and the provision of personalized safety prompts and warnings have become crucial for preventing traffic accidents. This paper proposes a risk field construction technique based on environmental data collected by in-vehicle sensors. This paper introduces a driving style recognition algorithm utilizing risk field visualization and mask learning technologies. The research results indicate that, compared to traditional classical models, the improved algorithm performs excellently in terms of accuracy, stability, and robustness, enhancing the accuracy of driving style recognition and enabling a more effective evaluation of road safety. [ABSTRACT FROM AUTHOR]

This paper conducts an in-depth study on the self-similar transformation, Darboux transformation, and the excitation and propagation characteristics of high-order bright–dark rogue wave solutions in the (2+1)-dimensional variable-coefficient Zakharov equation. The Zakharov equation is instrumental for studying complex nonlinear interactions in these areas, with specific implications for energy transfer processes in plasma and nonlinear wave propagation systems. By analyzing bright–dark rogue wave solutions—phenomena that are critical in understanding high-energy events in optical and fluid environments—this research elucidates the intricate dynamics of energy concentration and dissipation. Using the self-similar transformation method, we map the (2+1)-dimensional equation to a more tractable (1+1)-dimensional nonlinear Schrödinger equation form. Through the Lax pair and Darboux transformation, we successfully construct high-order solutions that reveal how variable coefficients influence rogue wave features, such as shape, amplitude, and dynamics. Numerical simulations demonstrate the evolution of these rogue waves, offering novel perspectives for predicting and mitigating extreme wave events in engineering applications.This paper crucially advances the practical understanding and manipulation of nonlinear wave phenomena in variable environments, providing significant insights for applications in optical fibers, atmospheric physics, and marine engineering. [ABSTRACT FROM AUTHOR]

This document discusses the challenges faced in mathematical modeling and controlling COVID-19 epidemics. It highlights the global impact of the pandemic on the economy and health, as well as the uneven effects on different age groups. The availability of vaccines led to mass vaccination campaigns, prompting researchers to implement new strategies and innovative approaches. The document also mentions various journals that have published special issues on COVID-19, covering topics such as forecasting, vaccination strategies, and control measures. The special issue presented in this document consists of eleven papers that analyze clinical characteristics, variant spread, economic recovery, mortality rates, non-pharmaceutical interventions, and coordinated actions. The papers propose mathematical models and control strategies to minimize disease spread and prioritize vaccination. The document emphasizes the multidisciplinary nature of the research, involving fields such as applied mathematics, data science, engineering, biology, and economics. Overall, this special issue provides valuable insights into the mathematical modeling and control of COVID-19 epidemics. [Extracted from the article]

Doubly coupled designs (DCDs) have better space-filling properties between the qualitative and quantitative factors than marginally coupled designs (MCDs) which are suitable for computer experiments with both qualitative and quantitative factors. In this paper, we propose a new class of DCDs, called group doubly coupled designs (GDCDs), and provide methods for constructing two forms of GDCDs, within-group doubly coupled designs and between-group doubly coupled designs. The proposed GDCDs can accommodate more qualitative factors than DCDs, when the subdesigns for the qualitative factors are symmetric. The subdesigns of qualitative factors are not asymmetric in the existing results on DCDs, and in this paper, we construct GDCDs with symmetric and asymmetric designs for the qualitative factors, respectively. Moreover, detailed comparisons with existing MCDs show that GDCDs have better space-filling properties between qualitative and quantitative factors. Finally, the methods are particularly easy to implement. [ABSTRACT FROM AUTHOR]

Fault dynamometer cards are the basis of the diagnosis technique for sucker rod pumping systems. Predicting fault cards with a pumping condition model is an economical and effective method. The usual model is described by a mixed function of the pump displacement and pump load, and it is difficult to use in the prediction method based on the analytical solution of the sucker rod string wave equation. In this paper, a normal pumping condition model described by a function of polished rod velocity is proposed. For the analytical solution of the sucker rod wave equation, an iterative prediction algorithm with pumping condition models is proposed, its convergence is analyzed, and then it is validated by classical finite difference method simulated cards and measured surface dynamometer cards. The results show that the proposed algorithm is accurate. The algorithm has a maximum relative error of 0.10% for the classical method simulated card area and 1.45% for the measured card area. The research of this paper provides an effective scheme for the design, prediction, and fault diagnosis of a sucker rod pumping system with an analytical solution. [ABSTRACT FROM AUTHOR]

In this study, the portfolio optimization problem is explored, using a combination of classical and quantum computing techniques. The portfolio optimization problem with specific objectives or constraints is often a quadratic optimization problem, due to the quadratic nature of, for example, risk measures. Quantum computing is a promising solution for quadratic optimization problems, as it can leverage quantum annealing and quantum approximate optimization algorithms, which are expected to tackle these problems more efficiently. Quantum computing takes advantage of quantum phenomena like superposition and entanglement. In this paper, a specific problem is introduced, where a portfolio of loans need to be optimized for 2030, considering 'Return on Capital' and 'Concentration Risk' objectives, as well as a carbon footprint constraint. This paper introduces the formulation of the problem and how it can be optimized using quantum computing, using a reformulation of the problem as a quadratic unconstrained binary optimization (QUBO) problem. Two QUBO formulations are presented, each addressing different aspects of the problem. The QUBO formulation succeeded in finding solutions that met the emission constraint, although classical simulated annealing still outperformed quantum annealing in solving this QUBO, in terms of solutions close to the Pareto frontier. Overall, this paper provides insights into how quantum computing can address complex optimization problems in the financial sector. It also highlights the potential of quantum computing for providing more efficient and robust solutions for portfolio management. [ABSTRACT FROM AUTHOR]

Digital financial inclusion and common prosperity are pivotal elements in promoting the sustainable socioeconomic development of China. This study introduces a novel Multi-Criteria Decision Analysis (MCDA) method to evaluate the Common Prosperity Index (CPI). Using this index, alongside the Digital Financial Inclusion Index (DFII) released by Peking University, it examines the evolution of the coupling coordination relationship between digital financial inclusion and common prosperity within the Yangtze River Delta (YRD) urban agglomeration from 2011 to 2021. By integrating gravity models and social network analysis, in this paper, we thoroughly investigate the spatiotemporal evolution characteristics of the spatial network of this coupling coordination relationship. The results indicate that both the DFII and CPI generally exhibit an upward trend, but the decline in the coupling degree reflects a weakened interaction strength between them. Specifically, Anhui significantly lags behind Jiangsu, Zhejiang, and Shanghai in the development of digital financial inclusion and common prosperity, indicating regional development imbalances. Furthermore, the strength of spatial connections in city coupling coordination has significantly increased, with Nanjing's siphon effect on cities in Anhui becoming markedly stronger, and the number of core cities in the network increasing, which demonstrates a geographical proximity feature in network development. Additionally, the overall network characteristics are transitioning towards higher density and "small-world" properties, suggesting a trend toward network stabilization. The disparity in centrality among cities has decreased, with an overall enhancement in centrality, where the spatial spillover effects from core areas such as Hangzhou-Ningbo, Nanjing-Changzhou, and Shanghai-Suzhou-Wuxi significantly promote the development of peripheral cities. Based on these findings, this paper proposes policy recommendations for the sustainable development of digital financial inclusion and common prosperity in the YRD region. [ABSTRACT FROM AUTHOR]

This paper aims to present a methodology for the application of matching methods in industry to measure causal effect size. Matching methods allow us to obtain treatment and control samples with their covariates as similar as possible. The matching techniques used are nearest, optimal, full, coarsened exact matching (CEM), and genetic. These methods have been widely used in medical, psychological, and economic sciences. The proposed methodology provides two algorithms to execute these methods and to conduct an exhaustive search for the best models. It uses three conditions to ensure, as far as possible, the balance of all covariates, the maximum number of units in the treatment and control groups, and the most significant causal effect sizes. These techniques are applied in the carton board industry, where the causal variable is downtime, and the outcome variable is waste generated. A dataset from the carton board industry is used, and the results are contrasted with an expert in this process. Meta-analysis techniques are used to integrate the results of different comparative studies, which could help to determine and prioritize where to reduce waste. Two machines were found to generate more waste in terms of standardized measures whose values are 0.52 and 0.53, representing 48.60 and 36.79 linear meters (LM) on average for each production order with a total downtime of more than 3000 s. In general, for all machines, the maximum average wastage for each production order is 24.98 LM and its confidence interval is [13.40;36.23] LM. The main contribution of this work is the use of causal methodology to estimate the effect of downtime on waste in an industry. Particularly relevant is the contribution of an algorithm that aims to obtain the best matching model for this application. Its advantages and disadvantages are evaluated, and future areas of research are outlined. We believe that this methodology can be applied to other industries and fields of knowledge. [ABSTRACT FROM AUTHOR]

Paper waste in the mockups design with regular, irregular, and amorphous patterns is a critical problem in digital printing presses. Paper waste reduction directly impacts production costs, generating business and environmental benefits. This problem can be mapped to the two-dimensional irregular bin-packing problem. In this paper, an iterated local search algorithm using a novel neighborhood structure to detect overlaps between amorphous shapes is introduced. This algorithm is used to solve the paper waste problem, modeled as one 2D irregular bin-packing problem. The experimental results show that this approach works efficiently and effectively to detect and correct the overlaps between regular, irregular, and amorphous figures. [ABSTRACT FROM AUTHOR]

Extensive uncertainty can affect the efficiency and fairness of consensus in the consensus reaching process (CRP), but few scholars have studied consensus modeling that focuses on fairness and efficiency in uncertain environments. Additionally, the weight of the decision maker (DM) in the CRP is influenced by multiple factors. Therefore, this paper proposes robust consensus models (EFCMs) focusing on fairness and efficiency under uncertain costs to address these issues. Firstly, this paper constructs multiple uncertainty sets to describe the uncertainty of the unit adjustment cost. Secondly, the fair utility level and opinion adjustment distance are used to measure the fairness and efficiency of reaching consensus, respectively. Furthermore, this paper uses a data-driven method based on the KDE method combined with trust propagation in social networks to determine the DMs' weights jointly. Finally, this paper also applies the proposed models to the carbon emission reduction negotiation process between the government and enterprises. The experimental results and sensitivity analysis show that the consensus cost budget and the DMs' jealous preference behavior particularly affects the efficiency of reaching consensus, which provides a theoretical basis for solving practical decision making problems. [ABSTRACT FROM AUTHOR]

Drone delivery in city logistics is gaining attention due to road congestion, environmental threats, etc. However, there are risks associated with using drones which can result in hazardous events, such as conflicts in the air, loss of control, and system failures. It is crucial to assess the risks involved in using different types of drones and choose the option with the lowest risk. The existence of different criteria important for this decision imposes the need to apply the multi-criteria decision-making (MCDM) method(s). This paper proposes a new hybrid model that combines the fuzzy Factor Relationship (FARE) method for obtaining the criteria weights and the Axial Distance-based Aggregated Measurement (ADAM) method for obtaining the final ranking of the alternatives. A single-rotor microdrone weighing up to 4.4 lb was chosen as the optimal solution, and after that, the most favorable are also the drones of this size (multi-rotor and fixed-wing microdrones). The establishment of a novel hybrid MCDM model, the identified risks, the set of criteria for evaluating the least risky drones, and the framework for prioritizing the drones are the main novelties and contributions of the paper. [ABSTRACT FROM AUTHOR]

This paper investigates the performance of a two-stage multi-criteria decision-making procedure for order scheduling problems. These problems are represented by a novel nonlinear mixed integer program. Hybridizations of three Multi-Objective Evolutionary Algorithms (MOEAs) based on dominance relations are studied and compared to solve small, medium, and large instances of the joint order batching and picking problem in storage systems with multiple blocks of two and three dimensions. The performance of these methods is compared using a set of well-known metrics and running an extensive battery of simulations based on a methodology widely used in the literature. The main contributions of this paper are (1) the hybridization of MOEAs to deal efficiently with the combination of orders in one or several picking tours, scheduling them for each picker, and (2) a multi-criteria approach to scheduling multiple picking teams for each wave of orders. Based on the experimental results obtained, it can be stated that, in environments with a large number of different items and orders with high variability in volume, the proposed approach can significantly reduce operating costs while allowing the decision-maker to anticipate the positioning of orders in the dispatch area. [ABSTRACT FROM AUTHOR]

The aim of this paper is to introduce a new type of two-dimensional convexity by using total-order relations. In the first part of this paper, we examine the Hyers–Ulam stability of two-dimensional convex mappings by using the sandwich theorem. Our next step involves the development of Hermite–Hadamard inequality, including its weighted and product forms, by using a novel type of fractional operator having non-singular kernels. Moreover, we develop several nontrivial examples and remarks to demonstrate the validity of our main results. Finally, we examine approximate convex mappings and have left an open problem regarding the best optimal constants for two-dimensional approximate convexity. [ABSTRACT FROM AUTHOR]

In this paper, we develop a two-level supply chain model with low carbon emissions for defective deteriorating items under learning in fuzzy environment by using the double inspection process. Carbon emissions are a major issue for the environment and human life when they come from many sources like different kinds of factories, firms, and industries. The burning of diesel and petrol during the supply of items through transportation is also responsible for carbon emissions. When any company, firm, or industry supplies their items through a supply chain by using of transportation in the regular mode, then a lot of carbon units are emitted from the burning of petrol and diesel, etc., which affects the supply chain. Carbon emissions can be controlled by using different kinds of policies issued by the government of a country, and lots of companies have implemented these policies to control carbon emissions. When a seller delivers a demanded lot size to the buyer, as per demand, and the lot size has some defective items, as per consideration, the demand rate is uncertain in nature. The buyer inspects the received whole lot and divides it into two categories of defective and no defective deteriorating items, as well as immediately selling at different price. The fuzzy concept nullifies the uncertain nature of the demand rate. This paper covers two models, assuming two conditions of quality screening under learning in fuzzy environment: (i) the buyer shows the quality screening and (ii) the quality inspection becomes the seller's responsibility. The carbon footprint from the transporting and warehousing the deteriorating items is also assumed. The aim of this study is to minimize the whole inventory cost for supply chains with respect to lot size and the number of orders per production cycle. Jointly optimizing the delivery lot size and number of orders per production cycle will minimize the whole fuzzy inventory cost for the supply chain and also reduce the carbon emissions. We take two numerical approaches with authentic data (from the literature reviews) for the justification of the proposed model 1 and model 2. Sensitivity observations, managerial insights, applications of these proposed models, and future scope are also included in this paper, which is more beneficial for firms, the industrial sector, and especially for online markets. The impact of the most effective parameters, like learning effect, fuzzy parameter, carbon emissions parameter, and inventory cost are shown in this study and had a positive effect on the total inventory cost for the supply chain. [ABSTRACT FROM AUTHOR]

Measuring systemic risk plays an important role in financial risk management to control systemic risk. By means of a vine copula grouped-CoES method, this paper aims to measure the systemic risk of Chinese financial markets. The empirical study indicates that the banking industry has a low risk and a strong ability to resist risks, but also contributes the most of the systemic risk. On the other hand, insurance companies and securities have high ES but low Δ CoES, indicating their low risk tolerance and small contribution to the systemic risk. Furthermore, this study employs a sliding window in Monte Carlo simulation to forecast systemic risk. The findings of this paper suggest that different types of financial industries should adopt different systemic risk measures. [ABSTRACT FROM AUTHOR]

This paper discusses the synchronization problem of impulsive stochastic bidirectional associative memory neural networks with a diffusion term, specifically focusing on the fixed-time (FXT) and predefined-time (PDT) synchronization. First, a number of more relaxed lemmas are introduced for the FXT and PDT stability of general types of impulsive nonlinear systems. A controller that does not require a sign function is then proposed to ensure that the synchronization error converges to zero within a predetermined time. The controllerdesigned in this paper serves the additional purpose of preventing the use of an unreliable inequality in the course of proving the main results. Next, to guarantee FXT and PDT synchronization of the drive–response systems, this paper employs the Lyapunov function method and derives sufficient conditions. Finally, a numerical simulation is presented to validate the theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, we generalize and study the concept of Hadamard product of ideals of projective varieties to the case of monomial ideals. We have a research direction similar to the one of the join of monomial ideals contained in a paper of Sturmfels and Sullivant. In the second part of the paper, we give a brief tutorial on the Hadamard.m2 package of Macaulay2. [ABSTRACT FROM AUTHOR]

Recent research has revealed that subtle imperceptible perturbations can deceive well-trained neural network models, leading to inaccurate outcomes. These instances, known as adversarial examples, pose significant threats to the secure application of machine learning techniques in safety-critical systems. In this paper, we delve into the study of one-pixel attacks in deep neural networks, recently reported as a kind of adversarial examples. To identify such one-pixel attacks, most existing methodologies rely on the differential evolution method, which utilizes random selection from the current population to escape local optima. However, the differential evolution technique might waste search time and overlook good solutions if the number of iterations is insufficient. Hence, in this paper, we propose a gradient ascent with momentum approach to efficiently discover good solutions for the one-pixel attack problem. As our method takes a more direct route to the goal compared to existing methods relying on blind random walks, it can effectively identify one-pixel attacks. Our experiments conducted on popular CNNs demonstrate that, in comparison with existing methodologies, our technique can detect one-pixel attacks significantly faster. [ABSTRACT FROM AUTHOR]

This paper discusses finding solutions to the modified Fractional Black–Scholes equation. As is well known, the options theory is beneficial in the stock market. Using call-and-pull options, investors can theoretically decide when to sell, hold, or buy shares for maximum profits. However, the process of forming the Black–Scholes model uses a normal distribution, where, in reality, the call option formula obtained is less realistic in the stock market. Therefore, it is necessary to modify the model to make the option values obtained more realistic. In this paper, the method used to determine the solution to the modified Fractional Black–Scholes equation is a combination of the finite difference method and the fractional differential transformation method. The results show that the combined method of finite difference and fractional differential transformation is a very good approximation for the solution of the Fractional Black–Scholes equation. [ABSTRACT FROM AUTHOR]

With developments in global economic integration and the increase in future economic uncertainty, it is imperative to have the ability to predict future capital in relation to financial capital inflow and outflow predictions to ensure capital optimization is within a controllable range within the current macroeconomic environment and situation. This paper proposes an automated capital prediction strategy for the capital supply chain using time series analysis artificial intelligence methods. Firstly, to analyze the fluctuation and tail risk of the financial characteristics, the paper explores the financial characteristics for measuring the dynamic VaR from the perspectives of volatility, tail, and peak with the Bayesian peaks over threshold (POT) model. Following this, in order to make the modeling more refined, the forecast targets are split before modeling with seasonal Autoregressive Integrated Moving Average (ARIMA) models and Prophet models. Finally, the time series modeling of the wavelet Long Short-Term Memory (LSTM) model is carried out using a two-part analysis method to determine the linear separated wavelet and non-linear embedded wavelet parts to predict strong volatility in financial capital. Taking the user capital flow of the Yu'e Bao platform, the results prove the feasibility and prediction accuracy of the innovative model proposed. [ABSTRACT FROM AUTHOR]

Navigation aids play a crucial role in guiding ship navigation and marking safe water areas. Therefore, ensuring the accurate and efficient recognition of a navigation aid's state is critical for maritime safety. To address the issue of sparse features in navigation aid data, this paper proposes an approach that involves three distinct processes: the extension of rank entropy space, the fusion of multi-domain features, and the extraction of hidden features (EFE). Based on these processes, this paper introduces a new LSTM model termed EFE-LSTM. Specifically, in the feature extension module, we introduce a rank entropy operator for space extension. This method effectively captures uncertainty in data distribution and the interrelationships among features. The feature fusion module introduces new features in the time domain, frequency domain, and time–frequency domain, capturing the dynamic features of signals across multiple dimensions. Finally, in the feature extraction module, we employ the BiLSTM model to capture the hidden abstract features of navigational signals, enabling the model to more effectively differentiate between various navigation aids states. Extensive experimental results on four real-world navigation aid datasets indicate that the proposed model outperforms other benchmark algorithms, achieving the highest accuracy among all state recognition models at 92.32%. [ABSTRACT FROM AUTHOR]

This paper conducts a brief survey of spatial unit roots within the context of spatial econometrics. We summarize important concepts and assumptions in this area and study the parameter space of the spatial autoregressive coefficient, which leads to the idea of spatial unit roots. Like the case in time series, the spatial unit roots lead to spurious regression because the system cannot achieve equilibrium. This phenomenon undermines the power of the usual Ordinary Least Squares (OLS) method, so various estimation methods such as Quasi-maximum Likelihood Estimate (QMLE), Two Stage Least Squares (2SLS), and Generalized Spatial Two Stage Least Squares (GS2SLS) are explored. This paper considers the assumptions needed to guarantee the identification and asymptotic properties of these methods. Because of the potential damage of spatial unit roots, we study some test procedures to detect them. Lastly, we offer insights into how to relax the compactness assumption to avoid spatial unit roots, as well as the relationship between spatial unit roots and other models, such as the Spatial Dynamic Panel Data (SDPD) model and Lévy–Brownian motion. [ABSTRACT FROM AUTHOR]

Large-scale wind farms incorporating doubly-fed induction generators (DFIGs) are considered a promising direction for modern energy supply systems due to their role in reducing dependence on fossil energy sources. However, the dynamic interactions between DFIGs and AC grids sometimes lead to sub-synchronous oscillation (SSO) that threatens the safe and stable operation of wind power systems. Therefore, it is essential to develop a mathematical model and design an algorithm to quantitatively design the control parameters. Such algorithms are helpful in preventing or mitigating system stability problems coming from wind power connected to the grid and reducing damage to power equipment. The traditional state-space model is mainly established to determine the stable operating point and analyze the influence of parameters on the system operating mode. However, this method does not provide the selection area for the system parameters. To address this shortcoming, this paper introduces a modular state-space model for DFIGs containing series compensation lines and proposes an algorithm for calculating the parameter selection area based on the Guardian map method. First, a detailed modular state-space model based on the virtual synchronous generator (VSG) control is established. The modular model helps to reflect the relationship between state variables and focuses on describing the operating state of DFIGs in wind farms. Second, this paper focuses on the influence of VSG control parameters and compensation capacitance on SSO. It aims to clarify the role of the series compensation level and control parameters on SSO based on VSG control. Then, an algorithm for the parameter selection area based on the Guardian map is proposed and the area of the VSG-controlled DFIG is obtained. Finally, the accuracy and validity of the algorithm are verified by time domain simulation in MATLAB/Simulink and HIL experiment. [ABSTRACT FROM AUTHOR]

COPA, introduced by Andreeva et al., is the first online authenticated encryption (AE) mode with nonce-misuse resistance, and it is covered in COLM, which is one of the final CAESAR portfolios. However, COPA has been proven to be insecure in the releasing unverified plaintext (RUP) setting. This paper mainly focuses on the integrity under RUP (INT-RUP) defect of COPA. Firstly, this paper revisits the INT-RUP security model for adaptive adversaries, investigates the possible factors of INT-RUP insecurity for "Encryption-Mix-Encryption"-type checksum-based AE schemes, and finds that these AE schemes with INT-RUP security vulnerabilities utilize a common poor checksum technique. Then, this paper introduces an improved checksum technique named polynomial intermediate checksum (PIC) for INT-RUP security and emphasizes that PIC is a sufficient condition for guaranteeing INT-RUP security for "Encryption-Mix-Encryption"-type checksum-based AE schemes. PIC is generated by a polynomial sum with full terms of intermediate internal states, which guarantees no information leakage. Moreover, PIC ensures the same level between the plaintext and the ciphertext, which guarantees that the adversary cannot obtain any useful information from the unverified decryption queries. Again, based on PIC, this paper proposes a modified scheme COPA-PIC to fix the INT-RUP defect of COPA. COPA-PIC is proven to be INT-RUP up to the birthday-bound security if the underlying primitive is secure. Finally, this paper discusses the properties of COPA-PIC and makes a comparison for AE modes with distinct checksum techniques. The proposed work is of good practical significance. In an interactive system where two parties communicate, the receiver can effectively determine whether the information received from the sender is valid or not, and thus perform the subsequent operation more effectively. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of parameter identification for discrete-time stochastic systems with unknown exogenous inputs. These systems form an important class of dynamic stochastic system models used to describe objects and processes under a high level of a priori uncertainty, when it is not possible to make any assumptions about the evolution of the unknown input signal or its statistical properties. The main purpose of this paper is to construct a new SVD-based modification of the existing Gillijns and De Moor filtering algorithm for linear discrete-time stochastic systems with unknown exogenous inputs. Using the theoretical results obtained, we demonstrate how this modified algorithm can be applied to solve the problem of parameter identification. The results of our numerical experiments conducted in MATLAB confirm the effectiveness of the SVD-based parameter identification method that was developed, under conditions of unknown exogenous inputs, compared to maximum likelihood parameter identification when exogenous inputs are known. [ABSTRACT FROM AUTHOR]

This paper explores two sample-based methods for analysing multistable systems: basin stability and basin entropy. Both methods rely on many numerical integration trials conducted with diverse initial conditions. The collected data is categorised and used to compute metrics that characterise solution stability, phase space structure, and system dynamics predictability. Basin stability assesses the overall likelihood of reaching specific solutions, while the basin entropy measure aims to capture the structure of attraction basins and the complexity of their boundaries. Although these two metrics complement each other effectively, their original procedures for computation differ significantly. This paper introduces a universal approach and algorithm for calculating basin stability and entropy measures. The suitability of these procedures is demonstrated through the analysis of two non-linear systems. [ABSTRACT FROM AUTHOR]

In this paper, a short review of the calculus of exact finite-differences of integer order is proposed. The finite-difference operators are called the exact finite-differences of integer orders, if these operators satisfy the same characteristic algebraic relations as standard differential operators of the same order on some function space. In this paper, we prove theorem that this property of the exact finite-differences is satisfies for the space of simple entire functions on the real axis (i.e., functions that can be expanded into power series on the real axis). In addition, new results that describe the exact finite-differences beyond the set of entire functions are proposed. A generalized expression of exact finite-differences for non-entire functions is suggested. As an example, the exact finite-differences of the square root function is considered. The use of exact finite-differences for numerical and computer simulations is not discussed in this paper. Exact finite-differences are considered as an algebraic analog of standard derivatives of integer order. [ABSTRACT FROM AUTHOR]

One of the aims of this paper is to characterize 3-complex symmetric weighted composition operators induced by three types of symbols on the weighted Bergman space of the right half-plane with the conjugation J f (z) = f (z ¯) ¯ . It is well known that the complex symmetry is equivalent to 2-complex symmetry for the weighted composition operators studied in the paper. However, the interesting fact that 3-complex symmetry is not equivalent to 2-complex symmetry for such operators is found in the paper. Finally, the complex normal of such operators on the weighted Bergman space of the right half-plane with the conjugation J is characterized. [ABSTRACT FROM AUTHOR]

Although the stability regions of wind turbines in the islanding mode have been widely researched, small-signal modeling of grid-forming wind turbines (GFWTs) in the islanding mode has yet to be explored. In addition, the state-space matrix of the wind turbine system has yet to be fully represented. Therefore, this paper proposes a small-signal modeling of GFWT and a method for identifying the stabilization region of a system with variable parameters. First, small-signal modeling of a GFWT based on virtual synchronous generator control is developed. Second, the bialternate sum matrix approach is used to determine the system stabilization region. The system matrix with multiple variable parameters is first decomposed into the sum of several matrices in this paper. Furthermore, the rotor-side generator control is simplified. It can reduce the dimensionality of the system matrix model. Finally, the simulation shows that the proposed method for determining the stabilization region of the variable system is accurate. [ABSTRACT FROM AUTHOR]

Long Short-Term Memory (LSTM) is an effective method for stock price prediction. However, due to the nonlinear and highly random nature of stock price fluctuations over time, LSTM exhibits poor stability and is prone to overfitting, resulting in low prediction accuracy. To address this issue, this paper proposes a novel variant of LSTM that couples the forget gate and input gate in the LSTM structure, and adds a "simple" forget gate to the long-term cell state. In order to enhance the generalization ability and robustness of the variant LSTM, the paper introduces an attention mechanism and combines it with the variant LSTM, presenting the Attention Mechanism Variant LSTM (AMV-LSTM) model along with the corresponding backpropagation algorithm. The parameters in AMV-LSTM are updated using the Adam gradient descent method. Experimental results demonstrate that the variant LSTM alleviates the instability and overfitting issues of LSTM, effectively improving prediction accuracy. AMV-LSTM further enhances accuracy compared to the variant LSTM, and compared to AM-LSTM, it exhibits superior generalization ability, accuracy, and convergence capability. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the consensus control problem of Euler–Lagrange systems which can be used to describe the motion of various mechanical systems such as manipulators and quadcopters. We focus on consensus control strategies, which are important for achieving coordinated behavior in multi-agent systems. The paper considers the key challenges posed by random communication delays and packet losses that are increasingly common in networked control systems. In addition, it is assumed that each system receives information from neighboring agents intermittently. Addressing these challenges is critical to ensure the reliability and efficiency of such systems in real-world applications. Communication delay is time-varying and can be very large, but should be smaller than some bounded constant. To decrease the frequency of control input updates, we implement an event-triggered scheme that regulates the controller's updates for each agent. Specifically, it does not update control inputs at traditional fixed intervals, but responds to predefined conditions and introduces a dynamic consensus item to handle information irregularities caused by communication delays and intermittent information exchange. The consensus can be achieved if the communication graph of agents contains a spanning tree with the desired velocity as the root node. That is, all Euler–Lagrange systems need to obtain the desired velocity, directly or indirectly (via neighbors), to reach consensus. We establish that the Zeno behavior can be avoided, ensuring a positive minimum duration between successive event-triggered instances. Finally, we provide simulation results to show the performance of our proposed algorithm. [ABSTRACT FROM AUTHOR]

This correction notice provides updates and corrections to a research paper on deep machine learning model-based cyber-attacks detection in smart power systems. The paper proposes a deep learning-based attack detection model that addresses system disturbances caused by natural events and cyber-attacks. It discusses the use of principal component analysis (PCA) for feature selection and the potential of deep learning-based and decision tree classifiers for detecting cyber-attacks in intelligent energy grids. The notice also includes updates to references, clarifications on the experimental data set, and feature selection based on PCA. The study evaluates the effectiveness of the proposed model using various assessment indexes and compares it to conventional methods, concluding that the proposed model is effective in detecting cyber-attacks and demonstrates good performance in detecting destructive attacks. [Extracted from the article]

In this paper, we investigate the Besov space and the Besov capacity and obtain several important capacitary inequalities in a strictly local Dirichlet space, which satisfies the doubling condition and the weak Bakry–Émery condition. It is worth noting that the capacitary inequalities in this paper are proved if the Dirichlet space supports the weak (1 , 2) -Poincaré inequality, which is weaker than the weak (1 , 1) -Poincaré inequality investigated in the previous references. Moreover, we first consider the strong subadditivity and its equality condition for the Besov capacity in metric space. [ABSTRACT FROM AUTHOR]

The rational field Q is highly desired in many applications. Algorithms using the rational number field Q algebraic number fields use only integer arithmetics and are easy to implement. Therefore, studying and designing systems and expansions with coefficients in Q or algebraic number fields is particularly interesting. This paper discusses constructing quasi-tight framelets with symmetry over an algebraic field. Compared to tight framelets, quasi-tight framelets have very similar structures but much more flexibility in construction. Several recent papers have explored the structure of quasi-tight framelets. The construction of symmetric quasi-tight framelets directly applies the generalized spectral factorization of 2 × 2 matrices of Laurent polynomials with specific symmetry structures. We adequately formulate the latter problem and establish the necessary and sufficient conditions for such a factorization over a general subfield F of C , including algebraic number fields as particular cases. Our proofs of the main results are constructive and thus serve as a guideline for construction. We provide several examples to demonstrate our main results. [ABSTRACT FROM AUTHOR]

This paper deals with the research of solutions of bounded variation (BV) to evolution inclusion coupled with a time and state dependent maximal monotone operator. Different problems are studied: existence of solutions, unicity of the solution, existence of periodic and bounded variation right continuous (BVRC) solutions. Second-order evolution inclusions and fractional (Caputo and Riemann–Liouville) differential inclusions are also considered. A result of the Skorohod problem driven by a time- and space-dependent operator under rough signal and a Volterra integral perturbation in the BRC setting is given. The paper finishes with some results for fractional differential inclusions under rough signals and Young integrals. Many of the given results are novel. [ABSTRACT FROM AUTHOR]

We study the square root computation by Leonardo Fibonacci (or Leonardo of Pisa) in his MSS Liber Abaci from c1202 and c1228 and De Practica Geometrie from c1220. In this MSS, Fibonacci systematically describes finding the integer part of the square root of an integer in numerous examples with three to seven decimal digits. The results of these examples are summarized in a table in the paper. Liber Abaci also describes in detail finding an approximation to the fractional part of the square root. However, in other examples in Liber Abaci and De Practica Geometrie, only the approximate values of the fractional part of the square roots are stated. This paper further explores these approximate values using techniques like reverse engineering. Contrary to many claims that Fibonacci also used other methods or approximations, we show that all examples can be explained using one digit-by-digit method to compute the integer part of the square root and one approximation scheme for the fractional part. Further, it is shown that the approximation scheme is tied to the method to compute the integer part of the square root. [ABSTRACT FROM AUTHOR]

This work surveys the use of directed weighted graphs in conducting comparative static analyses. The paper discusses the implementation of a computer-aided process for building spreadsheet-based graph models for inter- and intra-regional financial flows. The graph-theoretic techniques are programmed to enable the interactive visualization and analysis of financial data using Wolfram technologies (i.e., Mathematica software v. 11.3 or later, Wolfram player v. 12 or later). The paper describes the workflow for several interactive visualizations applicable to financial networks. The author provides four programs, written in the Wolfram language, that customize input–output financial models by combining the Manipulate command with built-in Mathematica functions and functions of the IGraph package (IGraph/M). The study is a tutorial article for the generation of a suite of visual schemes that provide patterns, practices, and roadmaps of the financial markets across the globe. [ABSTRACT FROM AUTHOR]

In this paper, we study a method of polynomial interpolation that lies in-between Lagrange and Hermite methods. The novelty is that we use very general nodal systems on the unit circle as well as on the bounded interval only characterized by a separation property. The way in which we interpolate consists in considering all the nodes for the prescribed values and only half for the derivatives. Firstly, we develop the theory on the unit circle, obtaining the main properties of the nodal polynomials and studying the convergence of the interpolation polynomials corresponding to continuous functions with some kind of modulus of continuity and with general conditions on the prescribed values for half of the derivatives. We complete this first part of the paper with the study of the convergence for smooth functions obtaining the rate of convergence, which is slightly slower than that when equidistributed nodal points are considered. The second part of the paper is devoted to solving a similar problem on the bounded interval by using nodal systems having good properties of separation, generalizing the Chebyshev–Lobatto system, and well related to the nodal systems on the unit circle studied before. We obtain an expression of the interpolation polynomials as well as results about their convergence in the case of continuous functions with a convenient modulus of continuity and, particularly, for differentiable functions. Finally, we present some numerical experiments related to the application of the method with the nodal systems dealt with. [ABSTRACT FROM AUTHOR]

In this paper, the derivation of a concise closed form for the gravitational field of a polyhedron is presented. This formula forms the basis of the algorithm for calculating the gravitational field of an arbitrary shape body with high accuracy. Based on this algorithm, a method for gravity data inversion (creating density models of the Earth's crust) has been developed. The algorithm can accept either regular or irregular polyhedron discretization for density model creation. The models are approximated with dense irregular grids, elements of which are polyhedrons. When performing gravity data inversion, we face three problems: topography with large amplitude, the sphericity of the planet, and a long computation time because of the large amount of data. In our previous works, we have already considered those problems separately but without explaining the details of the computation of the closed-form solution for a polyhedron. In this paper, we present for the first time a performance-effective numerical method for the inversion of gravity data based on topography. The method is based on closed-form expression for the gravity field of a spherical density model of the Earth's crust with the upper topography layer, and provides great accuracy and speed of calculation. There are no restrictions on the model's geometry or gravity data grid. As a case study, a spherical density model of the Earth's crust of the Urals is created. [ABSTRACT FROM AUTHOR]

The COVID-19 epidemic has required countries to implement different containment strategies to limit its spread, like strict or weakened national lockdown rules and the application of age-stratified vaccine prioritization strategies. These interventions have in turn modified the age-dependent patterns of social contacts. In our recent paper, starting from the available age-structured real data at the national level, we identified, for the Italian case, specific virulence parameters for a two-age-structured COVID-19 epidemic compartmental model (under 60, and 60 years and over) in six different diseases transmission scenarios under concurrently adopted feedback interventions. An interpretation of how each external scenario modifies the age-dependent patterns of social contacts and the spread of COVID-19 disease has been accordingly provided. In this paper, which can be viewed as a sequel to the previous one, we mainly apply the same general methodology therein (involving the same dynamic model) to new data covering the three subsequent additional scenarios: (i) a mitigated coordinated intermittent regional action in conjunction with the II vaccination phase; (ii) a super-attenuated coordinated intermittent regional action in conjunction with the II vaccination phase; and (iii) a last step towards normality in conjunction with the start of the III vaccination phase. As a new contribution, we show how meaningful updated information can be drawn out, once the identification of virulence parameters, characterizing the two age groups within the latest three different phases, is successfully carried out. Nevertheless, differently from our previous paper, the global optimization procedure is carried out here with the number of susceptible individuals in each scenario being left free to change, to account for reinfection and immunity due to vaccination. Not only do the slightly different estimates we obtain for the previous scenarios not impact any of the previous considerations (and thus illustrate the robustness of the procedure), but also, and mainly, the new results provide a meaningful picture of the evolution of social behaviors, along with the goodness of strategic interventions. [ABSTRACT FROM AUTHOR]

In recent years, various forms of progressive hybrid censoring schemes (PHCS) have gained significant traction in survival and reliability analysis studies due to their versatility. However, these PHCS variants are often characterized by complexity stemming from the multitude of parameters involved in their specification. Consequently, the primary objective of this paper is to propose a unified approach termed combined type II progressive hybrid censoring scheme ( ComT 2 PHCS) capable of encompassing several existing PHCS variations. Our analysis focuses specifically on the exponential distribution (ExDist). Bayesian inference techniques are employed to estimate the parameters of the ExDist under the ComT 2 PHCS. Additionally, we conduct fundamental distributional analyses and likelihood inference procedures. We derive the conditional moment-generating function (CondMGF) of maximum likelihood estimator (MLE) for parameters of the ExDist under ComT 2 PHCS. Further, we use CondMGF for the distribution of MLE for parameters of ExDist under ComT 2 PHCS. Finally, we provide an illustrative example to elucidate the inference methods derived in this paper. [ABSTRACT FROM AUTHOR]

Modeling and verification of the correct behavior of embedded real-time systems with strict timing constraints is a well-known and important problem. Failing to fulfill a deadline in system operation can have severe consequences in the practical case. This paper proposes an approach to formal modeling and schedulability analysis. A novel extension of Petri Nets named Constraint Time Petri Nets (C-TPN) is developed, which enables the modeling of a collection of interdependent real-time tasks whose execution is constrained by the use of priority and shared resources like processors and memory data. A C-TPN model is reduced to a network of Timed Automata in the context of the popular Uppaal toolbox. Both functional and, most importantly, temporal properties can be assessed by exhaustive model checking and/or statistical model checking based on simulations. This paper first describes and motivates the proposed C-TPN modeling language and its formal semantics. Then, a Uppaal translation is shown. Finally, three models of embedded real-time systems are considered, and their properties are thoroughly verified. [ABSTRACT FROM AUTHOR]

This paper presents our research on a traffic signal control system (TSCS) at V2X intersections. The overall objective of the study is to create an implementable TSCS. The specific objective of this paper is to investigate a distributed system towards implementation. The objective function of minimizing queue delay is formulated as the integral of queue lengths. The discrete queueing estimation is mixed with macro and micro traffic flow models. The novel proposed architecture alleviates the communication network bandwidth constraint by processing BSMs and computing queue lengths at the local intersection. In addition, a two-stage distributed system is designed to optimize offsets, splits, and cycle length simultaneously and in real time. The paper advances TSCS theories by contributing a novel analytic formulation of delay functions and their first degree of derivatives for a two-stage optimization model. The open-source traffic simulation engine Enhanced Transportation Flow Open-Source Microscopic Model (ETFOMM version 1.2) was selected as a simulation environment to develop, debug, and evaluate the models and the system. The control delay of the major direction, minor direction, and the total network were collected to assess the system performance. Compared with the optimized TSCS timing plan by the Virginia Department of Transportation, the system generated a 21% control delay reduction in the major direction and a 7% control delay reduction in the minor direction at just a 10% penetration rate of connected vehicles. Finally, the proposed distributed and centralized systems present similar performances in the case study. [ABSTRACT FROM AUTHOR]

Thedistribution of products stands out as one of the pivotal activities for logistics companies in recent years, particularly in the aftermath of the COVID-19 pandemic and other geopolitical events. Intense competition compels companies to efficiently execute their logistical processes, with cross-docking emerging as a frequently applied solution. However, the location of cross-dock terminals in urban areas remains a problem insufficiently addressed in the literature, with a dearth of studies and models tackling this issue. This paper introduces a novel and innovative model for locating cross-dock terminals based on the CI-DEA–IDOCRIW–MABAC (Composite Indicators–Data Envelopment Analysis-Integrated Determination of Objective Criteria Weights–Multi-Attributive Border Approximation Area Comparison) methods. In the process of defining input indicators, the following three sources were utilized: relevant literature, practical insights from logistics experts, and the knowledge and experience of the authors. Eight inputs and three outputs were considered (the number of users in the observed channel; the area served by the channel; the average distance a vehicle travels in one delivery; the required number of vehicles; labor availability; competition; construction, and expansion possibilities; proximity to the main infrastructure and traffic facilities; the average number of deliveries; average delivered quantity; and service level). The model underwent testing in a case study analyzing nine distribution channels (areas within the observed urban zone). The results indicated that alternative A4 (in the southwest area) ranked the highest since it was the best-ranked in accordance with the most important criteria, suggesting that the terminal is best located in the southwest zone. The accuracy of the results was confirmed by company management. By developing a completely new model and addressing the identified gap in the literature, this paper provides unequivocal scientific contributions. [ABSTRACT FROM AUTHOR]

This paper focuses on optimizing the Zuker RNA folding algorithm, a bioinformatics task with non-serial polyadic dynamic programming and non-uniform loop dependencies. The intricate dependence pattern is represented using affine formulas, enabling the automatic application of tiling strategies via the polyhedral method. Three source-to-source compilers—PLUTO, TRACO, and DAPT—are employed, utilizing techniques such as affine transformations, the transitive closure of dependence relation graphs, and space–time tiling to generate cache-efficient codes, respectively. A dedicated transpose code technique for non-serial polyadic dynamic programming codes is also examined. The study evaluates the performance of these optimized codes for speed-up and scalability on multi-core machines and explores energy efficiency using RAPL. The paper provides insights into related approaches and outlines future research directions within the context of bioinformatics algorithm optimization. [ABSTRACT FROM AUTHOR]

In this study, we extended the applicability of a derivative-free algorithm to encompass the solution of operators that may be either differentiable or non-differentiable. Conditions weaker than the ones in earlier studies are employed for the convergence analysis. The earlier results considered assumptions up to the existence of the ninth order derivative of the main operator, even though there are no derivatives in the algorithm, and the Taylor series on the finite Euclidian space restricts the applicability of the algorithm. Moreover, the previous results could not be used for non-differentiable equations, although the algorithm could converge. The new local result used only conditions on the divided difference in the algorithm to show the convergence. Moreover, the more challenging semi-local convergence that had not previously been studied was considered using majorizing sequences. The paper included results on the upper bounds of the error estimates and domains where there was only one solution for the equation. The methodology of this paper is applicable to other algorithms using inverses and in the setting of a Banach space. Numerical examples further validate our approach. [ABSTRACT FROM AUTHOR]