In the present work we study the existence of solutions for hybrid nonlinear fractional integrodifferential equations. We developed an algorithm by using the operator theoretical techniques in order to obtain the approximate solutions. The main results depend on the Dhage iteration method that were incorporated with the modern hybrid fixed point theorems. The approximate solutions were obtained by using Lipschitz conditions and weaker form of mixed partial continuity. Further, we provide some examples to explain the hypotheses and the related results.

In this work the existence and nonexistence of stationary radial solutions to the elliptic partial differential equation arising in the molecular beam epitaxy are studied. Since we are interested in radial solutions we arrive at the following fourth-order differential equation

Motivated by important applications to the analysis of complex noise-induced phenomena, a problem of the constructive description of randomly forced equilibria for nonlinear systems with multiplicative noise is considered. Using apparatus of the first approximation systems, we construct an approximation of mean square deviations that explicitly takes into account the presence of multiplicative noise. This approximation is compared with the widely used approximation based on the stochastic sensitivity technique. The general mathematical results are illustrated with the example of the van der Pol oscillator with hard excitement.

Using geometric considerations, we provide a clear derivation of the integral representation for the error function, known as the Craig formula. We calculate the corresponding power series expansion and prove the convergence. The same geometric means finally help to systematically derive handy formulas that approximate the inverse error function. Our approach can be used for applications in e.g. high-speed Monte Carlo simulations where this function is used extensively.

Understanding the spatially varying effects of demographic factors on the spatio-temporal variation of intestinal parasites infections is important for public health intervention and monitoring. This paper presents a hierarchical Bayesian spatially varying coefficient model to evaluate the effects demographic factors on intestinal parasites morbidities in Ghana. The modeling relied on morbidity data collected by the District Health Information Management Systems. We developed Poisson and Poisson-gamma spatially varying coefficient Models. We used the demographic factors, unsafe drinking water, unsafe toilet and unsafe liquid waste disposal as model covariates. The models were fitted using the Integrated Nested Laplace Approximations (INLA). The overall risk of intestinal parasites infection was estimated to be 10.9 per 100 people with a wide spatial variation in the district-specific posterior risk estimates. Substantial spatial variation of increasing multiplicative effects of unsafe drinking water, unsafe toilet and unsafe liquid waste disposal occurs on the variation of intestinal parasites risk. The structured residual spatial variation widely dominates the unstructured component, suggesting that the unaccounted-for risk factors are spatially continuous in nature. The study concludes that both the spatial distribution of the posterior risk and the associated exceedance probability maps are essential for monitoring and control of intestinal parasites.

Widely used in hydraulics, the Colebrook equation for flow friction relates implicitly to the input parameters; the Reynolds number, Re and the relative roughness of inner pipe surface, ε/D with the output unknown parameter; the flow friction factor, λ; λ=f(λ, Re, ε/D). In this paper, a few explicit approximations to the Colebrook equation; λ≈f(Re, ε/D), are generated using the ability of artificial intelligence to make inner patterns to connect input and output parameters in explicit way not knowing their nature or the physical law that connects them, but only knowing raw numbers, {Re, ε/D}→{λ}. The fact that the used genetic programming tool does not know the structure of the Colebrook equation which is based on computationally expensive logarithmic law, is used to obtain better structure of the approximations which is less demanding for calculation but also enough accurate. All generated approximations are with low computational cost because they contain a limited number of logarithmic forms used although for normalization of input parameters or for acceleration, but they are also sufficiently accurate. The relative error regarding the friction factor λ, in best case is up to 0.13% with only two logarithmic forms used. As the second logarithm can be accurately approximated by the Padé approximation, practically the same error is obtained also using only one logarithm.

In order to deal with imprecision, ambiguity, and uncertainty in data analysis, Pawlak introduced rough set theory in 1982. This paper aims to expand the scope of basic set theory developed by presenting the notions of δP-upper and δP-lower approximations, that are based on the notion of δP-open sets, we additionally examine a few of their fundamental characteristics.

In this study, we investigate the performance of the saddlepoint approximation of the probability mass function and the cumulative distribution function for the weighted sum of independent Poisson random variables. The goal is to approximate the hazard rate function for this complicated model. The better performance of this method is shown by numerical simulations and comparison with a performance of other approximation methods.

The Bessel function of the first kind J_N(kx) is expanded in a Fourier-Legendre series, as is the modified Bessel functions of the first kind I_N(kx) . Known polynomial approximations for the range −3≤x≤3 (having five-digit accuracy) are compared with those arising from this Legendre series and substitute versions are given with twice the number of terms and range (with five-digit accuracy or having fifteen-digit accuracy over −3≤x≤3). It is shown that infinite series of like-powered contributors (involving _2F_3 hypergeometric functions) extracted from the Fourier-Legendre series may be summed, having values that are inverse powers of the first five primes 1/(2^i 3^j 5^k 7^l 11^mm) for powers of order x24.

In this paper, we study properties of formal concepts from an order-theoretic perspective. We first establish a natural correspondence between formal contexts and preorders as well as their induced posets. Then, based on the poset induced from a formal context, we provide characterization for join-irreducible or meet-irreducible elements of finite concept lattices. In addition, we introduce the notion of rough conceptual approximations based on topological closure and interior operators. In contrast with the conventional definition of equivalence class of an object used in Pawlakian approximation spaces, we instead utilize the extent of an object concept. We show that rough conceptual approximations are equivalent to approximation operators in the generalized approximation space associated with the preorder corresponding to a formal context. We also illustrate these theoretical results with examples and discuss their potential applications.

Using only a limited number of computationally expensive functions, we show a way how to construct accurate and computationally efficient approximations of the Colebrook equation for flow friction. The presented approximations are based on the asymptotic series expansion of the Wright ω-function and symbolic regression. The results are verified with 8 million of Quasi-Monte Carlo points covering the domain of interest for engineers. In comparison with the built-in “wrightOmega” feature of Matlab R2016a, the herein introduced related approximations of the Wright ω-function significantly accelerate the computation. With only two logarithms and several basic arithmetic operations used, the presented approximations are not only computationally efficient but also extremely accurate. The maximal relative error of the most promising approximation which is given in the form suitable for engineers’ use is limited to 0.0012%, while for a little bit more complex variant is limited to 0.000024%.

The Colebrook equation ζ is implicitly given in respect to the unknown flow friction factor λ ; λ=ζ(Re,ε*,λ) which cannot be expressed explicitly in exact way without simplifications and use of approximate calculus. Common approach to solve it is through the Newton-Raphson iterative procedure or through the fixed-point iterative procedure. Both requires in some case even eight iterations. On the other hand numerous more powerful iterative methods such as three-or two-point methods, etc. are available. The purpose is to choose optimal iterative method in order to solve the implicit Colebrook equation for flow friction accurately using the least possible number of iterations. The methods are thoroughly tested and those which require the least possible number of iterations to reach the accurate solution are identified. The most powerful three-point methods require in worst case only two iterations to reach final solution. The recommended representatives are Sharma-Guha-Gupta, Sharma-Sharma, Sharma-Arora, Džunić-Petković-Petković; Bi-Ren-Wu, Chun-Neta based on Kung-Traub, Neta, and Jain method based on Steffensen scheme. The recommended iterative methods can reach the final accurate solution with the least possible number of iterations. The approach is hybrid between iterative procedure and one-step explicit approximations and can be used in engineering design for initial rough, but also for final fine calculations.

This paper studies an effective finite difference scheme for solving two-dimensional Heston stochastic volatility option pricing model problems. A dynamically balanced up-downwind strategy for approximating the cross-derivative is implemented and analyzed. Semi-discretized and spatially nonuniform platforms are utilized. The numerical method comprised is simple, straightforward with reliable first order overall approximations. The spectral norm is used throughout the investigation and numerical stability is proven. Simulation experiments are given to illustrate our results.

The Colebrook equation is a popular model for estimating friction loss coefficients in water and gas pipes. The model is implicit in the unknown flow friction factor . To date, the captured flow friction factor can be extracted from the logarithmic form analytically only in the term of the Lambert -function. The purpose of this study is to find an accurate and computationally efficient solution based on the shifted Lambert -function also known as the Wright -function. The Wright -function is more suitable because it overcomes the problem with the overflow error by switching the fast growing term of the Lambert -function to the series expansions that further can be easily evaluated in computers without causing overflow run-time errors. Although the Colebrook equation transformed through the Lambert -function is identical to the original expression in term of accuracy, a further evaluation of the Lambert -function can be only approximate. Very accurate explicit approximations of the Colebrook equation that contains only one or two logarithms are shown. The final result is an accurate explicit approximation of the Colebrook equation with the relative error of no more than 0.0096%. The presented approximations are in the form suitable for everyday engineering use, they are both accurate and computationally efficient.

This paper explores innovative approaches to determining eigenvalues and eigenvectors through the combination of neural networks and traditional numerical methods. Traditional methods like the Newton-Raphson and Durand-Kerner algorithms are proven effective but often require good initial approximations and can be sensitive to the choice of starting points. In this study, we propose a hybrid approach that uses neural networks to generate better initial approximations, which are then iteratively refined using traditional methods. By combining the pattern recognition power of neural networks with the adaptability of traditional numerical methods, we demonstrate faster convergence and higher accuracy in determining eigenvalues and eigenvectors. Experimental results on various polynomials of different degrees and characteristics show that our hybrid approach outperforms individual methods, providing a more robust and efficient solution.

Empirical Colebrook equation from 1939 is still accepted as an informal standard to calculate friction factor during the turbulent flow (4000 < Re < 10⁸) through pipes from smooth with almost negligible relative roughness (ε/D→0) to the very rough (up to ε/D = 0.05) inner surface. The Colebrook equation contains flow friction factor λ in implicit logarithmic form where it is, aside of itself; λ, a function of the Reynolds number Re and the relative roughness of inner pipe surface ε/D; λ = f (λ, Re, ε/D). To evaluate the error introduced by many available explicit approximations to the Colebrook equation, λ ≈ f(Re, ε/D), it is necessary to determinate value of the friction factor λ from the Colebrook equation as accurate as possible. The most accurate way to achieve that is using some kind of iterative methods. Usually classical approach also known as simple fixed point method requires up to 8 iterations to achieve the high level of accuracy, but does not require derivatives of the Colebrook function as here presented accelerated Householder’s approach (3^rd order, 2^nd order: Halley’s and Schröder’s method and 1^st order: Newton-Raphson) which needs only 3 to 7 iteration and three-point iterative methods which needs only 1 to 4 iteration to achieve the same high level of accuracy. Strategies how to find derivatives of the Colebrook function in symbolic form, how to avoid use of the derivatives (Secant method) and how to choose optimal starting point for the iterative procedure are shown. Householder’s approach to the Colebrook’s equations expressed through the Lambert W-function is also analyzed. One approximation to the Colebrook equation based on the analysis from the paper with the error of no more than 0.0617% is shown.

In this paper, we present a comparative analysis of seventeen different approaches to optimizing Euclidean distance computations, a core mathematical operation that plays a critical role in a wide range of algorithms, particularly in machine learning and data analysis. The Euclidean distance, being a computational bottleneck in large-scale optimization problems, requires efficient computation techniques to improve the performance of various distance-dependent algorithms. To address this, several optimization strategies can be employed to accelerate distance computations. From spatial data structures and approximate nearest neighbor algorithms to dimensionality reduction, vectorization, and parallel computing, various approaches exist to accelerate Euclidean distance computation in different contexts. Such approaches are particularly important for speeding up key machine learning algorithms like K-means and K-nearest neighbors (KNN). By understanding the trade-offs and assessing the effectiveness, complexity, and scalability of various optimization techniques, our findings help practitioners choose the most appropriate methods for improving Euclidean distance computations in specific contexts. These optimizations enable scalable and efficient processing for modern data-driven tasks, directly leading to reduced energy consumption and a minimized environmental impact.

In this paper, two double Jordan-type inequalities are introduced based on the papers [1]-[5]. These inequalities generalize the inequalities obtained in [1]-[5]. As a result, some new upper and lower bounds of the sinc function are obtained. This extension of Jordan’s inequality is enabled by considering the corresponding inequalities through the concept of stratified families of functions elaborated in [6]. Based on this approach, some optimal approximations of the sinc function are derived by determining corresponding minimax approximants, also described in the paper [6].

We propose a novel framework for understanding quantum phenomena through the lens of a modified electromagnetic spacetime governed by Einstein field equations. By assuming the existence of an electromagnetic spacetime that adheres to these modified geodesic and Einstein field equations, provided the field equations satisfy the Coulomb force law in weak-field approximations, we explore the derivation of Maxwell’s equations and highlight the necessity of incorporating spin to validate these equations. We derive the wave equation for the normalized transverse metric and establish its equivalence with the de Broglie wave proposition, suggesting a relationship between this metric and the particle's wavefunction. This approach offers a classical explanation for several quantum phenomena, including the double-slit experiment, entanglement, tunneling, non-locality, and wavefunction collapse. Additionally, it posits a method to visualize atomic orbital structures in line with quantum mechanical predictions. These findings suggest that the foundational principles of quantum mechanics can be interpreted as linearized approximations of general relativity applied to electromagnetic spacetime. While this theory does not yet extend to the correlations between general relativity, quantum electrodynamics (QED), and quantum chromodynamics (QCD), it provides a valuable visualization tool for physicists and advances our understanding of the unresolved challenges linking quantum mechanics with general relativity.