In this article, the new Ishikawa iteration method is presented to find the approximate solution of an ordinary differential equation with an initial condition. Additionally, some numerical examples with initial conditions are given to show the properties of the iteration method. Furthermore, the results of absolute errors are compared with Euler, Runge-Kutta and Picard iteration methods. Finally, the present method, namely the new modified Ishikawa iteration method, is seen to be very effective and efficient in solving different type of the problem. MSC:65K15, 65L07, 65L06, 65L70.
The main aim of this paper is to investigate the efficient Chebyshev wavelet collocation method for Ginzburg-Landau equation. The basic idea of this method is to have the approximation of Chebyshev wavelet series of a non-linear PDE. We demonstrate how to use the method for the numerical solution of the Ginzburg-Landau equation with initial and boundary conditions. For this purpose, we have obtained operational matrix for Chebyshev wavelets. By applying this technique in Ginzburg-Landau equation, the PDE is converted into an algebraic system of non-linear equations and this system has been solved using MAPLE computer algebra system. We demonstrate the validity and applicability of this technique which has been clarified by using an example. Exact solution is compared with an approximate solution. Moreover, Chebyshev wavelet collocation method is found to be acceptable, efficient, accurate and computational for the non-linear or PDE.
Forecasting scrap steel prices is crucial for the economic sustainability of recycling operations, yet it remains challenging due to inherent volatility and non-stationary behavior. In this study, we develop and evaluate a delta-targeted Hybrid forecasting pipeline for short horizons of 1, 3, and 7 days. We benchmark classical baselines (Naive, Seasonal Autoregressive Integrated Moving Average (SARIMA), and Exponential Smoothing (ETS)) against recurrent deep learning models (Simple Recurrent Neural Network (RNN), Gated Recurrent Unit (GRU), and Long Short-Term Memory (LSTM)) and recent neural forecasting baselines, including Decomposition-Linear (DLinear), Convolutional Kolmogorov–Arnold Network (C-KAN), and Neural Basis Expansion Analysis for Time Series (N-BEATS), using real-world daily scrap steel price data. The results indicate that delta-targeting generally yields more stable predictive performance than direct raw-price forecasting as the prediction horizon increases. For example, at the 7-day horizon, the predictive fit improves from approximately for raw-price LSTM to around for delta-trained recurrent models. At the same horizon, a delta-based RNN achieves the lowest Mean Absolute Percentage Error (MAPE) among the evaluated models (approximately ), while the proposed Hybrid model remains competitive across all tested horizons and maintains a goodness-of-fit of approximately without uniformly minimizing point error relative to the best-performing recurrent baseline. Attention profiling and permutation-based feature importance analyses indicate that the model places relatively higher weight on calendar-related inputs, consistent with the presence of weekly patterns in the data; these results should be interpreted as sensitivity diagnostics rather than causal evidence. Overall, the findings suggest that delta-transformed targets provide a more suitable prediction space than raw-price targets for short-horizon scrap steel forecasting, while the Hybrid design offers a balanced combination of predictive performance and diagnostic interpretability for operational decision support.
Scalar centrality measures assign one score to each sector of a production network and cannot compare its exposure to two shock sources. We develop a matrix-algebraic framework for this comparison. The Asymmetry Multiplier , the ratio of the price responses of a target sector to equal increments in unit value added at two sources, factors into a direct ratio and a network amplification ratio. Using sub-eigenvectors of the technical coefficient matrix, we derive lower and upper bounds that hold for every productive network and reduce to Perron–Frobenius bounds under irreducibility. We also prove that linear price responses bound those of competitive constant-returns economies from above and that no labeling-independent node-level measure determines the multiplier. A symmetric structural decomposition separates technological and final demand effects. As a proof of concept, the framework is applied to electricity and mining cost shocks in Türkiye. In 2022, the multiplier ranges from 0.20 to 1.86 across eleven sectors, indirect paths attenuate the direct ratio by a factor of 8 to 22 in six sectors, and Basic Metals is more exposed to mining than to electricity cost shocks, through imported mining inputs. For most sectors, the dominant channel is robust to disaggregation, coefficient perturbation and the annual tables of 2012–2022.
Finding the root is one of the most common problems in scientific disciplines. Due to their increasing importance in a wide variety of practical applications, nonlinear functions are utilized across the entire spectrum of various areas within mathematics, science, and engineering. Using computers to solve these functions is very important, especially in today's world. The most important things to think about when working out the roots of non-linear equations are how well the method works and how much it costs to do it. A better method is more effective and less expensive. Considering these facts, the main aim of this paper is to present a new method that doesn't involve derivatives and is more efficient. This paper presents an approach to solving nonlinear equations by extending the Lagrange method to find roots of polynomial curves. These equations can be solved using various iterative techniques, including the Secant, Newton-Raphson, Bisection, Regula Falsi, and others. The objective is to find the roots of such equations without considering any derivative operations. This is achieved by considering polynomial curves produced using Lagrange interpolation under specific initial circumstances. The effectiveness of the proposed approach is demonstrated by examining well-documented cases from the literature. It could also be used in mathematical modeling, optimization, and computational science, making it useful for solving many practical problems.
The main objective of this paper is to introduce and investigate a new subclass of Sakaguchi-type analytic bi-univalent functions in the open unit disk, defined by a two-sided subordination condition to the four-leaf function , whose image is a four-leaf-shaped domain. For suitable choices of the complex parameter b with , , and the real parameters and , we study the class of bi-univalent functions f for which both f and its inverse satisfy a Sakaguchi-type subordination condition involving the fundamental ratios and together with the difference quotient . Coefficient inequalities for the initial Taylor–Maclaurin coefficients are obtained, and Fekete–Szegő-type estimates are derived for the associated coefficient functional. Furthermore, graphical representations of the image domains are provided, which illustrate the geometric behavior of the functions in and confirm that the proposed class is non-trivial. The present investigation extends recent studies on subclasses of analytic and bi-univalent functions associated with geometrically structured mappings and contributes to the visual interpretation of their analytic properties.