Search

In some previous works, two of the authors introduced a technique to design high-order numerical methods for one-dimensional balance laws that preserve all their stationary solutions. The basis of these methods is a well-balanced reconstruction operator. Moreover, they introduced a procedure to modify any standard reconstruction operator, like MUSCL, ENO, CWENO, etc., in order to be well-balanced. This strategy involves a non-linear problem at every cell at every time step that consists in finding the stationary solution whose average is the given cell value. In a recent paper, a fully well-balanced method is presented where the non-linear problems to be solved in the reconstruction procedure are interpreted as control problems. The goal of this paper is to introduce a new technique to solve these local non-linear problems based on the application of the collocation RK methods. Special care is put to analyze the effects of computing the averages and the source terms using quadrature formulas. A general technique which allows us to deal with resonant problems is also introduced. To check the efficiency of the methods and their well-balance property, they have been applied to a number of tests, ranging from easy academic systems of balance laws consisting of Burgers equation with some non-linear source terms to the shallow water equations—without and with Manning friction—or Euler equations of gas dynamics with gravity effects.

In this paper, we construct and study a new family of multi-point Ehrlich-type iterative methods for approximating all the zeros of a uni-variate polynomial simultaneously. The first member of this family is the two-point Ehrlich-type iterative method introduced and studied by Trićković and Petković in 1999. The main purpose of the paper is to provide local and semilocal convergence analysis of the multi-point Ehrlich-type methods. Our local convergence theorem is obtained by an approach that was introduced by the authors in 2020. Two numerical examples are presented to show the applicability of our semilocal convergence theorem.

This paper provides several error estimations for total variation (TV) type regularization, which arises in a series of areas, for instance, signal and imaging processing, machine learning, etc. In this paper, some basic properties of the minimizer for the TV regularization problem such as stability, consistency and convergence rate are fully investigated. Both a priori and a posteriori rules are considered in this paper. Furthermore, an improved convergence rate is given based on the sparsity assumption. The problem under the condition of non-sparsity, which is common in practice, is also discussed, the results of the corresponding convergence rate are also presented under certain mild conditions.

In previous papers, a technique has been suggested to avoid order reduction when integrating initial boundary value problems with several kinds of exponential methods. The technique implies in principle to calculate additional terms at each step from those already necessary without avoiding order reduction. The aim of the present paper is to explain the surprising result that, many times, in spite of having to calculate more terms at each step, the computational cost of doing it through Krylov methods decreases instead of increases. This is very interesting since, in that way, the methods improve not only in terms of accuracy, but also in terms of computational cost.

This paper is devoted to the study of the Cubic B-splines to find the numerical solution of linear and non-linear 8th order BVPs that arises in the study of astrophysics, magnetic fields, astronomy, beam theory, cylindrical shells, hydrodynamics and hydro-magnetic stability, engineering, applied physics, fluid dynamics, and applied mathematics. The recommended method transforms the boundary problem to a system of linear equations. The algorithm we are going to develop in this paper is not only simply the approximation solution of the 8th order BVPs using Cubic-B spline but it also describes the estimated derivatives of 1st order to 8th order of the analytic solution. The strategy is effectively applied to numerical examples and the outcomes are compared with the existing results. The method proposed in this paper provides better approximations to the exact solution.

This paper constructs the generalized viscosity implicit midpoint rule for nonexpansive mappings in Banach space. It obtains strong convergence conclusions for the proposed algorithm and promotes the related results in this field. Moreover, this paper gives some applications. Finally, the paper gives six numerical examples to support the main results.

By giving a counter-example, we point out a gap in the paper by Karapinar (Adv. Theory Nonlinear Anal. Its Appl. 2018, 2, 85–87) where the given fixed point may be not unique and we present the corrected version. We also state the celebrated fixed point theorem of Reich–Rus–Ćirić in the framework of complete partial metric spaces, by taking the interpolation theory into account. Some examples are provided where the main result in papers by Reich (Can. Math. Bull. 1971, 14, 121–124, Boll. Unione Mat. Ital. 1972, 4, 26–42 and Boll. Unione Mat. Ital. 1971, 4, 1–11.) is not applicable.

The fractional calculus is useful in describing the natural phenomena with memory effect. This paper addresses the fractional form of Ambartsumian equation with a delay parameter. It may be a challenge to obtain accurate approximate solution of such kinds of fractional delay equations. In the literature, several attempts have been conducted to analyze the fractional Ambartsumian equation. However, the previous approaches in the literature led to approximate power series solutions which converge in subdomains. Such difficulties are solved in this paper via the Homotopy Perturbation Method (HPM). The present approximations are expressed in terms of the Mittag-Leffler functions which converge in the whole domain of the studied model. The convergence issue is also addressed. Several comparisons with the previous published results are discussed. In particular, while the computed solution in the literature is physical in short domains, with our approach it is physical in the whole domain. The results reveal that the HPM is an effective tool to analyzing the fractional Ambartsumian equation.

This paper further improves the Lie group method with Magnus expansion proposed in a previous paper by the authors, to solve some types of direct singular Sturm&ndash, Liouville problems. Next, a concrete implementation to the inverse Sturm&ndash, Liouville problem algorithm proposed by Barcilon (1974) is provided. Furthermore, computational feasibility and applicability of this algorithm to solve inverse Sturm&ndash, Liouville problems of higher order (for n=2,4) are verified successfully. It is observed that the method is successful even in the presence of significant noise, provided that the assumptions of the algorithm are satisfied. In conclusion, this work provides a method that can be adapted successfully for solving a direct (regular/singular) or inverse Sturm&ndash, Liouville problem (SLP) of an arbitrary order with arbitrary boundary conditions.

The aim of this paper is to study the Lagrange interpolation on the unit circle taking only into account the separation properties of the nodal points. The novelty of this paper is that we do not consider nodal systems connected with orthogonal or paraorthogonal polynomials, which is an interesting approach because in practical applications this connection may not exist. A detailed study of the properties satisfied by the nodal system and the corresponding nodal polynomial is presented. We obtain the relevant results of the convergence related to the process for continuous smooth functions as well as the rate of convergence. Analogous results for interpolation on the bounded interval are deduced and finally some numerical examples are presented.

In this paper, we present the application of the homotopy analysis method for solving integrodifferential equations. In this method, a series is created, the successive elements of which are determined by calculating the appropriate integral of the previous element. In this elaboration, we prove that, if this series is convergent, then its sum is the solution of the objective equation. We formulate and prove the sufficient condition of this convergence, and we give also the estimation of error of an approximate solution obtained by taking the partial sum of the considered series. Moreover, we present in this paper the example of using the investigated method for determining the vibrations of the freely supported reinforced concrete beam as well as for solving the equation of movement of the electromagnet jumper mechanical system.

This paper deals with the design and implementation of cross-platform, D2Q9-BGK and D3Q27-MRT, lattice Boltzmann method solver for 2D and 3D flows developed with ArrayFire library for high-performance computing. The solver leverages ArrayFire’s just-in-time compilation engine for compiling high-level code into optimized kernels for both CUDA and OpenCL GPU backends. We also provide C++ and Rust implementations and show that it is possible to produce fast cross-platform lattice Boltzmann method simulations with minimal code, effectively less than 90 lines of code. An illustrative benchmarks (lid-driven cavity and Kármán vortex street) for single and double precision floating-point simulations on 4 different GPUs are provided.

The Boltzmann equation is essential to the accurate modeling of rarefied gases. Unfortunately, traditional numerical solvers for this equation are too computationally expensive for many practical applications. With modern interest in hypersonic flight and plasma flows, to which the Boltzmann equation is relevant, there would be immediate value in an efficient simulation method. The collision integral component of the equation is the main contributor of the large complexity. A plethora of new mathematical and numerical approaches have been proposed in an effort to reduce the computational cost of solving the Boltzmann collision integral, yet it still remains prohibitively expensive for large problems. This paper aims to accelerate the computation of this integral via machine learning methods. In particular, we build a deep convolutional neural network to encode/decode the solution vector, and enforce conservation laws during post-processing of the collision integral before each time-step. Our preliminary results for the spatially homogeneous Boltzmann equation show a drastic reduction of computational cost. Specifically, our algorithm requires O(n3) operations, while asymptotically converging direct discretization algorithms require O(n6), where n is the number of discrete velocity points in one velocity dimension. Our method demonstrated a speed up of 270 times compared to these methods while still maintaining reasonable accuracy.

This paper focuses on a method to construct wavelet Riesz bases with homogeneous boundary condition and use them to a kind of second-order elliptic equation. First, we construct the splines on the interval [0,1] and consider their approximation properties. Then we define the wavelet bases and illustrate the condition numbers of stiffness matrices are small and bounded. Finally, several numerical examples show that our approach performs efficiently.

In this paper, we introduce and analyze the behavior of a nonlinear subdivision operator called PPH, which comes from its associated PPH nonlinear reconstruction operator on nonuniform grids. The acronym PPH stands for Piecewise Polynomial Harmonic, since the reconstruction is built by using piecewise polynomials defined by means of an adaption based on the use of the weighted Harmonic mean. The novelty of this work lies in the generalization of the already existing PPH subdivision scheme to the nonuniform case. We define the corresponding subdivision scheme and study some important issues related to subdivision schemes such as convergence, smoothness of the limit function, and preservation of convexity. In order to obtain general results, we consider s quasi-uniform grids. We also perform some numerical experiments to reinforce the theoretical results. This research was funded by the Fundación Séneca, Agencia de Ciencia y Technología de la Región de Murcia grant number 20928/PI/18 and by the Spanish national research project PID2019-108336GB-I00.

In this paper, we present a multiscale model reduction technique for unsaturated filtration problem in fractured porous media using an Online Generalized Multiscale finite element method. The flow problem in unsaturated soils is described by the Richards equation. To approximate fractures we use the Discrete Fracture Model (DFM). Complex geometric features of the computational domain requires the construction of a fine grid that explicitly resolves the heterogeneities such as fractures. This approach leads to systems with a large number of unknowns, which require large computational costs. In order to develop a more efficient numerical scheme, we propose a model reduction procedure based on the Generalized Multiscale Finite element method (GMsFEM). The GMsFEM allows solving such problems on a very coarse grid using basis functions that can capture heterogeneities. In the GMsFEM, there are offline and online stages. In the offline stage, we construct snapshot spaces and solve local spectral problems to obtain multiscale basis functions. These spectral problems are defined in the snapshot space in each local domain. To improve the accuracy of the method, we add online basis functions in the online stage. The construction of the online basis functions is based on the local residuals. The use of online bases will allow us to get a significant improvement in the accuracy of the method. We present results with different number of offline and online multisacle basis functions. We compare all results with reference solution. Our results show that the proposed method is able to achieve high accuracy with a small computational cost.

This paper presents a practical numerical method, an implicit finite-difference scheme for solving a two-dimensional time-space fractional Fokker–Planck equation with space–time depending on variable coefficients and source term, which represents a model of a Brownian particle in a periodic potential. The Caputo derivative and the Riemann–Liouville derivative are considered in the temporal and spatial directions, respectively. The Riemann–Liouville derivative is approximated by the standard Grünwald approximation and the shifted Grünwald approximation. The stability and convergence of the numerical scheme are discussed. Finally, we provide a numerical example to test the theoretical analysis.

In this paper, under the framework of Extended Chebyshev space, four new generalized quasi cubic trigonometric Bernstein basis functions with two shape functions α(t) and β(t) are constructed in a generalized quasi cubic trigonometric space span{1,sin2t,(1−sint)2α(t),(1−cost)2β(t)}, which includes lots of previous work as special cases. Sufficient conditions concerning the two shape functions to guarantee the new construction of Bernstein basis functions are given, and three specific examples of the shape functions and the related applications are shown. The corresponding generalized quasi cubic trigonometric Bézier curves and the corner cutting algorithm are also given. Based on the new constructed generalized quasi cubic trigonometric Bernstein basis functions, a kind of new generalized quasi cubic trigonometric B-spline basis functions with two local shape functions αi(t) and βi(t) is also constructed in detail. Some important properties of the new generalized quasi cubic trigonometric B-spline basis functions are proven, including partition of unity, nonnegativity, linear independence, total positivity and C2 continuity. The shape of the parametric curves generated by the new proposed B-spline basis functions can be adjusted flexibly.

The paper presents fourth order Runge–Kutta methods derived from symmetric Hermite–Obreshkov schemes by suitably approximating the involved higher derivatives. In particular, starting from the multi-derivative extension of the midpoint method we have obtained a new symmetric implicit Runge–Kutta method of order four, for the numerical solution of first-order differential equations. The new method is symplectic and is suitable for the solution of both initial and boundary value Hamiltonian problems. Moreover, starting from the conjugate class of multi-derivative trapezoidal schemes, we have derived a new method that is conjugate to the new symplectic method.

In this paper, we present a convergent collocation method with which to find the numerical solution of a generalized fractional integro-differential equation (GFIDE). The presented approach is based on the collocation method using Jacobi poly-fractonomials. The GFIDE is defined in terms of the B-operator introduced recently, and it reduces to Caputo fractional derivative and other fractional derivatives in special cases. The convergence and error analysis of the proposed method are also established. Linear and nonlinear cases of the considered GFIDEs are numerically solved and simulation results are presented to validate the theoretical results.

A computational framework for the construction of solutions to linear homogenous partial differential equations (PDEs) with variable coefficients is developed in this paper. The considered class of PDEs reads: ∂p∂t−∑j=0m∑r=0njajrtxr∂jp∂xj=0 F-operators are introduced and used to transform the original PDE into the image PDE. Factorization of the solution into rational and exponential parts enables us to construct analytic solutions without direct integrations. A number of computational examples are used to demonstrate the efficiency of the proposed scheme.

In this paper, a symmetric eight-step predictor method (explicit) of 10th order is presented for the numerical integration of IVPs of second-order ordinary differential equations. This scheme has variable coefficients and can be used as a predictor stage for other implicit schemes. First, we showed the singular P-stability property of the new method, both algebraically and by plotting the stability region. Then, having applied it to well-known problems like Mathieu equation, we showed the advantage of the proposed method in terms of efficiency and consistency over other methods with the same order.

In conventional modeling, shared control points can be employed to realize a unified representation for an object consisting of only curves or only surfaces touching one another. However, this method fails in treating the following two cases: (a) a system consisting of detached curves or surfaces, (b) a system having both curves and surfaces. The purpose of the present paper is to develop a new theoretical tool to solve such problems. By introducing the definitions of naked knot and I-mesh, the concept of I-spline is put forth, which is, in essence, an expanded B-spline or T-spline. It is verified by examples that the naked knots make I-splines flexible and effective in transforming different surfaces and/or curves into a unified one, especially in the above two cases.

In this paper, we mainly investigate the weak convergence analysis about the error terms which are determined by the discretization for solving the stochastic differential equation (SDE, for short) in forward-backward stochastic differential equations (FBSDEs, for short), which is on the basis of Itô Taylor expansion, the numerical SDE theory, and numerical FBSDEs theory. Under the weak convergence analysis of FBSDEs, we further establish better error estimates of recent numerical schemes for solving FBSDEs.

One of the well-known schemes for the direct numerical integration of second-order initial-value problems is due to Falkner (Falkner, 1936. Phil. Mag. S. 7, 621). This paper focuses on the construction of a family of adapted block Falkner methods which are frequency dependent for the direct numerical solution of second-order initial value problems with oscillatory solutions. The techniques of collocation and interpolation are adopted here to derive the new methods. The study of the properties of the proposed adapted block Falkner methods reveals that they are consistent and zero-stable, and thus, convergent. Furthermore, the stability analysis and the algebraic order conditions of the proposed methods are established. As may be seen from the numerical results, the resulting family is efficient and competitive compared to some recent methods in the literature.

This paper studies a semilinear parabolic equation in 1D along with nonlocal boundary conditions. The value at each boundary point is associated with the value at an interior point of the domain, which is known as a four-point boundary condition. First, the solvability of a steady-state problem is addressed and a constructive algorithm for finding a solution is proposed. Combining this schema with the semi-discretization in time, a constructive algorithm for approximation of a solution to a transient problem is developed. The well-posedness of the problem is shown using the semigroup theory in C-spaces. Numerical experiments support the theoretical algorithms.

In this paper, approaches to the numerical recovering of the initial condition in the inverse problem for a nonlinear singularly perturbed reaction–diffusion–advection equation are considered. The feature of the formulation of the inverse problem is the use of additional information about the value of the solution of the equation at the known position of a reaction front, measured experimentally with a delay relative to the initial moment of time. In this case, for the numerical solution of the inverse problem, the gradient method of minimizing the cost functional is applied. In the case when only the position of the reaction front is known, the method of deep machine learning is applied. Numerical experiments demonstrated the possibility of solving such kinds of considered inverse problems.

The main purpose of this paper is to study the Cauchy problem of sixth order viscous Cahn&ndash, Hilliard equation with Willmore regularization. Because of the existence of the nonlinear Willmore regularization and complex structures, it is difficult to obtain the suitable a priori estimates in order to prove the well-posedness results, and the large time behavior of solutions cannot be shown using the usual Fourier splitting method. In order to overcome the above two difficulties, we borrow a fourth-order linear term and a second-order linear term from the related term, rewrite the equation in a new form, and introduce the negative Sobolev norm estimates. Subsequently, we investigate the local well-posedness, global well-posedness, and decay rate of strong solutions for the Cauchy problem of such an equation in R3, respectively.

The most well-known equations both in the theory of nonlinearity and dispersion, KdV equations, have received tremendous attention over the years and have been used as model equations for the advancement of the theory of solitons. In this paper, some semi-analytic methods are applied to solve linearized dispersive KdV equations with homogeneous and inhomogeneous source terms. These methods are the Laplace-Adomian decomposition method (LADM), Homotopy perturbation method (HPM), Bernstein-Laplace-Adomian Method (BALDM), and Reduced Differential Transform Method (RDTM). Three numerical experiments are considered. As the main contribution, we proposed a new scheme, known as BALDM, which involves Bernstein polynomials, Laplace transform and Adomian decomposition method to solve inhomogeneous linearized dispersive KdV equations. Besides, some modifications of HPM are also considered to solve certain inhomogeneous KdV equations by first constructing a newly modified homotopy on the source term and secondly by modifying Laplace&rsquo, s transform with HPM to build HPTM. Both modifications of HPM numerically confirm the efficiency and validity of the methods for some test problems of dispersive KdV-like equations. We also applied LADM and RDTM to both homogeneous as well as inhomogeneous KdV equations to compare the obtained results and extended to higher dimensions. As a result, RDTM is applied to a 3D-dispersive KdV equation. The proposed iterative schemes determined the approximate solution without any discretization, linearization, or restrictive assumptions. The performance of the four methods is gauged over short and long propagation times and we compute absolute and relative errors at a given time for some spatial nodes.

In this paper, we introduce a high order numerical approximation method for convection diffusion wave equations armed with a multiterm time fractional Caputo operator and a nonlinear fixed time delay. A temporal second-order scheme which is behaving linearly is derived and analyzed for the problem under consideration based on a combination of the formula of L2&minus, 1&sigma, and the order reduction technique. By means of the discrete energy method, convergence and stability of the proposed compact difference scheme are estimated unconditionally. A numerical example is provided to illustrate the theoretical results.

In this paper, we have considered a numerical difference approximation for solving two-dimensional Riesz space fractional convection-diffusion problem with source term over a finite domain. The convection and diffusion equation can depend on both spatial and temporal variables. Crank-Nicolson scheme for time combined with weighted and shifted Gr&uuml, nwald-Letnikov difference operator for space are implemented to get second order convergence both in space and time. Unconditional stability and convergence order analysis of the scheme are explained theoretically and experimentally. The numerical tests are indicated that the Crank-Nicolson scheme with weighted shifted Gr&uuml, nwald-Letnikov approximations are effective numerical methods for two dimensional two-sided space fractional convection-diffusion equation.

This paper describes temporally second-order unconditionally stable direct methods for Allen&ndash, Cahn and conservative Allen&ndash, Cahn equations on surfaces. The discretization is performed via a surface mesh consisting of piecewise triangles and its dual-surface polygonal tessellation. We prove that the proposed schemes, which combine a linearly stabilized splitting scheme, are unconditionally energy-stable. The resulting system of discrete equations is linear and is simple to implement. Several numerical experiments are performed to demonstrate the performance of our proposed algorithm.

In this paper, a finite volume element (FVE) method is proposed for the time fractional Sobolev equations with the Caputo time fractional derivative. Based on the L1-formula and the Crank&ndash, Nicolson scheme, a fully discrete Crank&ndash, Nicolson FVE scheme is established by using an interpolation operator Ih*. The unconditional stability result and the optimal a priori error estimate in the L2(&Omega, )-norm for the Crank&ndash, Nicolson FVE scheme are obtained by using the direct recursive method. Finally, some numerical results are given to verify the time and space convergence accuracy, and to examine the feasibility and effectiveness for the proposed scheme.

The purpose of this paper is to investigate a system of differential equations related to the viscous flow over a stretching sheet. It is assumed that the intended environment for the flow includes a chemical reaction and a magnetic field. The governing equations are defined on the semi-finite domain and a numerical scheme, namely rational Gegenbauer collocation method is applied to solve it. In this method, the problem is solved in its main interval (semi-infinite domain) and there is no need to truncate it to a finite domain or change the domain of the problem. By carefully examining the effect of important physical parameters of the problem and comparing the obtained results with the answers of other methods, we show that despite the simplicity of the proposed method, it has a high degree of convergence and good accuracy.

Linear differential equations of a distributed order with an unbounded operator in a Banach space are studied in this paper. A theorem on the generation of analytic resolving families of operators for such equations is proved. It makes it possible to study the unique solvability of inhomogeneous equations. A perturbation theorem for the obtained class of generators is proved. The results of the work are illustrated by an example of an initial boundary value problem for the ultraslow diffusion equation with the lower-order terms with respect to the spatial variable.

In this paper, we present new Tensor extrapolation methods as generalizations of well known vector, matrix and block extrapolation methods such as polynomial extrapolation methods or ϵ-type algorithms. We will define new tensor products that will be used to introduce global tensor extrapolation methods. We discuss the application of these methods to the solution of linear and non linear tensor systems of equations and propose an efficient implementation of these methods via the global-QR decomposition.

In this paper, we present a numerical scheme and alternating direction implicit scheme for the one-dimensional time&ndash, space fractional vibration equation. Firstly, the considered time&ndash, space fractional vibration equation is equivalently transformed into their partial integro-differential forms by using the integral operator. Secondly, we use the Crank&ndash, Nicholson scheme based on the weighted and shifted Gr&uuml, nwald&ndash, difference formula to discretize the Riemann&ndash, Liouville and Caputo derivative, also use the midpoint formula to discretize the first order derivative. Meanwhile, the classical central difference formula is applied to approximate the second order derivative. The convergence and unconditional stability of the suggested scheme are obtained. Finally, we present an example to illustrate the method.

This paper uses a locking-free nonconforming Crouzeix&ndash, Raviart finite element to solve the planar linear elastic eigenvalue problem with homogeneous pure displacement boundary condition. Making full use of the Poincar&eacute, inequality, we obtain the guaranteed lower bounds for eigenvalues. Besides, we also use the nonconforming Crouzeix&ndash, Raviart finite element to the planar linear elastic eigenvalue problem with the pure traction boundary condition, and obtain the guaranteed lower eigenvalue bounds. Finally, numerical experiments with MATLAB program are reported.

In this paper, we consider unsaturated filtration in heterogeneous porous media with rough surface topography. The surface topography plays an important role in determining the flow process and includes multiscale features. The mathematical model is based on the Richards&rsquo, equation with three different types of boundary conditions on the surface: Dirichlet, Neumann, and Robin boundary conditions. For coarse-grid discretization, the Generalized Multiscale Finite Element Method (GMsFEM) is used. Multiscale basis functions that incorporate small scale heterogeneities into the basis functions are constructed. To treat rough boundaries, we construct additional basis functions to take into account the influence of boundary conditions on rough surfaces. We present numerical results for two-dimensional and three-dimensional model problems. To verify the obtained results, we calculate relative errors between the multiscale and reference (fine-grid) solutions for different numbers of multiscale basis functions. We obtain a good agreement between fine-grid and coarse-grid solutions.

Optimal fourth-order multiple-root finders with parameter &lambda, were conjugated via the M&ouml, bius map applied to a simple polynomial function. The long-term dynamics of these conjugated maps in the &lambda, parameter plane was analyzed to discover some properties of periodic, bounded and chaotic orbits. The &lambda, parameters for periodic orbits in the parameter plane are painted in different colors depending on their periods, and the bounded or chaotic ones are colored black to illustrate &lambda, dependent connected components. When a red fixed component in the parameter plane branches into a q-periodic component, we encounter geometric bifurcation phenomena whose characteristics determine the desired boundary equation and bifurcation point. Computational results along with illustrated components support the bifurcation phenomena underlying this paper.

In this paper, a self-accelerating type method is proposed for solving nonlinear equations, which is a modified Ren&rsquo, s method. A simple way is applied to construct a variable self-accelerating parameter of the new method, which does not increase any computational costs. The highest convergence order of new method is 2 + 6 &asymp, 4.4495 . Numerical experiments are made to show the performance of the new method, which supports the theoretical results.

In this paper, firstly we prove the relationship between interval h-convex functions and interval harmonically h-convex functions. Secondly, several new Hermite&ndash, Hadamard type inequalities for interval h-convex functions via interval Riemann&ndash, Liouville type fractional integrals are established. Finally, we obtain some new fractional Hadamard&ndash, Hermite type inequalities for interval harmonically h-convex functions by using the above relationship. Also we discuss the importance of our results and some special cases. Our results extend and improve some previously known results.

In this paper, we study the solvability of various two-point boundary value problems for x ( 4 ) = f ( t , x , x &prime, x &Prime, x ‴ ) , t &isin, ( 0 , 1 ) , where f may be defined and continuous on a suitable bounded subset of its domain. Imposing barrier strips type conditions, we give results guaranteeing not only positive solutions, but also monotonic ones and such with suitable curvature.

The introduction of the common limit range property on V -fuzzy metric spaces is the foremost aim of this paper. Furthermore, significant results for coupled maps are proven by employing this property on V -fuzzy metric spaces. More precisely, we introduce the notion of C L R &Omega, property for the mappings &Theta, M &times, M &rarr, M and &Omega, M . We utilize our new notion to present and prove our new fixed point results.

This paper deals with the Tikhonov regularization for nonlinear ill-posed operator equations in Hilbert scales with oversmoothing penalties. One focus is on the application of the discrepancy principle for choosing the regularization parameter and its consequences. Numerical case studies are performed in order to complement analytical results concerning the oversmoothing situation. For example, case studies are presented for exact solutions of H&ouml, lder type smoothness with a low H&ouml, lder exponent. Moreover, the regularization parameter choice using the discrepancy principle, for which rate results are proven in the oversmoothing case in in reference (Hofmann, B., Math&eacute, P. Inverse Probl. 2018, 34, 015007) is compared to H&ouml, lder type a priori choices. On the other hand, well-known analytical results on the existence and convergence of regularized solutions are summarized and partially augmented. In particular, a sketch for a novel proof to derive H&ouml, lder convergence rates in the case of oversmoothing penalties is given, extending ideas from in reference (Hofmann, B., Plato, R. ETNA. 2020, 93).

Many real-life problems can be reduced to scalar and vectorial nonlinear equations by using mathematical modeling. In this paper, we introduce a new iterative family of the sixth-order for a system of nonlinear equations. In addition, we present analyses of their convergences, as well as the computable radii for the guaranteed convergence of them for Banach space valued operators and error bounds based on the Lipschitz constants. Moreover, we show the applicability of them to some real-life problems, such as kinematic syntheses, Bratu&rsquo, s, Fisher&rsquo, s, boundary value, and Hammerstein integral problems. We finally wind up on the ground of achieved numerical experiments, where they perform better than other competing schemes.

Bifurcations have been studied with an extensive analysis of boundary curves of red, fixed components in the parametric space for a uniparametric family of simple-root finders under the M&ouml, bius conjugacy map applied to a quadratic polynomial. An elementary approach from the perspective of a plane curve theory properly describes the geometric figures resembling a circle or cardioid to characterize the underlying boundary curves that are parametrically expressed. Moreover, exact bifurcation points for satellite components on the boundaries have been found, according to the fact that the tangent line at a bifurcation point simultaneously touches the red fixed component and the satellite component. Computational experiments implemented with examples well reflect the significance of the theoretical backgrounds pursued in this paper.

Fractional calculus, albeit a synonym of fractional integrals and derivatives which have two main characteristics&mdash, singularity and nonlocality&mdash, has attracted increasing interest due to its potential applications in the real world. This mathematical concept reveals underlying principles that govern the behavior of nature. The present paper focuses on numerical approximations to fractional integrals and derivatives. Almost all the results in this respect are included. Existing results, along with some remarks are summarized for the applied scientists and engineering community of fractional calculus.

In this paper, we consider the inverse problem of derivative order estimation in a fractional logistic model. In order to solve the direct problem, we use the Gr&uuml, nwald-Letnikov fractional derivative, then the inverse problem is tackled within a Bayesian perspective. To construct the likelihood function, we propose an explicit numerical scheme based on the truncated series of the derivative definition. By MCMC samples of the marginal posterior distributions, we estimate the order of the derivative and the growth rate parameter in the dynamic model, as well as the noise in the observations. To evaluate the methodology, a simulation was performed using synthetic data, where the bias and mean square error are calculated, the results give evidence of the effectiveness for the method and the suitable performance of the proposed model. Moreover, an example with real data is presented as evidence of the relevance of using a fractional model.

Surface modeling is closely related to interpolation and approximation by using level set methods, radial basis functions methods, and moving least squares methods. Although radial basis functions with global support have a very good approximation effect, this is often accompanied by an ill-conditioned algebraic system. The exceedingly large condition number of the discrete matrix makes the numerical calculation time consuming. The paper introduces a truncated exponential function, which is radial on arbitrary n-dimensional space R n and has compact support. The truncated exponential radial function is proven strictly positive definite on R n while internal parameter l satisfies l &ge, &lfloor, n 2 &rfloor, + 1 . The error estimates for scattered data interpolation are obtained via the native space approach. To confirm the efficiency of the truncated exponential radial function approximation, the single level interpolation and multilevel interpolation are used for surface modeling, respectively.