Abstract: Continuously differentiable radial basis functions (RBFs) are meshfree, converge faster as the dimensionality increases, and is theoretically spectrally convergent. When implemented on current single and double precision computers, such RBFs can suffer from ill-conditioning because the systems of equations needed to be solved to find the expansion coefficients are full. However, the Advanpix extended precision software package allows computer mathematics to resemble asymptotically ideal Platonic mathematics. Additionally, full systems with extended precision execute faster graphical processors units and field-programmable gate arrays because no branching is needed. Sparse equation systems are fast for iterative solvers in a very limited number of cases.
Abstract: In this work, a five step continuous method for the solution of third order ordinary differential equations was developed in block form using collocation and interpolation techniques of the shifted Legendre polynomial basis function. The method was found to be zero-stable, consistent and convergent. The application of the method in solving third order initial value problem of ordinary differential equations revealed that the method compared favorably with existing methods.
Abstract: The aim of this study is to examine, through
experimentation in the laboratory, the supercritical flow in the
presence of an obstacle in a rectangular channel. The supercritical
regime in the whole hydraulic channel is achieved by adding a
convergent. We will observe the influence of the obstacle shape and
dimension on the characteristics of the supercritical flow, mainly the
free-surface elevation and the velocity profile. The velocity
measurements have been conducted with the one dimension laser
anemometry technique.
Abstract: In this paper, we present preconditioned generalized
accelerated overrelaxation (GAOR) methods for solving certain
nonsingular linear system. We compare the spectral radii of the
iteration matrices of the preconditioned and the original methods. The
comparison results show that the preconditioned GAOR methods
converge faster than the GAOR method whenever the GAOR method
is convergent. Finally, we give two numerical examples to confirm our
theoretical results.
Abstract: In this paper, we present new preconditioned modified accelerated overrelaxation (MAOR) method for solving linear systems. We compare the spectral radii of the iteration matrices of the preconditioned and the original methods. The comparison results show that the preconditioned MAOR method converges faster than the MAOR method whenever the MAOR method is convergent. Finally, we give one numerical example to confirm our theoretical results.
Abstract: In this paper, we present new preconditioned generalized mixed-type splitting (GMTS) methods for solving weighted linear least square problems. We compare the spectral radii of the iteration matrices of the preconditioned and the original methods. The comparison results show that the preconditioned GMTS methods converge faster than the GMTS method whenever the GMTS method is convergent. Finally, we give a numerical example to confirm our theoretical results.
Abstract: This paper derived four newly schemes which are combined in order to form an accurate and efficient block method for parallel or sequential solution of third order ordinary differential equations of the form y''' = f(x, y, y', y''), y(α)=y0, y'(α)=β, y''(α)=η with associated initial or boundary conditions. The implementation strategies of the derived method have shown that the block method is found to be consistent, zero stable and hence convergent. The derived schemes were tested on stiff and non – stiff ordinary differential equations, and the numerical results obtained compared favorably with the exact solution.
Abstract: This paper examines the development of one step, five hybrid point method for the solution of first order initial value problems. We adopted the method of collocation and interpolation of power series approximate solution to generate a continuous linear multistep method. The continuous linear multistep method was evaluated at selected grid points to give the discrete linear multistep method. The method was implemented using a constant order predictor of order seven over an overlapping interval. The basic properties of the derived corrector was investigated and found to be zero stable, consistent and convergent. The region of absolute stability was also investigated. The method was tested on some numerical experiments and found to compete favorably with the existing methods.
Abstract: For the last years, the variants of the Newton-s method with cubic convergence have become popular iterative methods to find approximate solutions to the roots of non-linear equations. These methods both enjoy cubic convergence at simple roots and do not require the evaluation of second order derivatives. In this paper, we present a new Newton-s method based on contra harmonic mean with cubically convergent. Numerical examples show that the new method can compete with the classical Newton's method.
Abstract: The aim of this work is to determine the supersonic
nozzle profiles used in propulsion, for the launchers or embarked
with the satellites. This design has as a role firstly, to give a
important propulsion, i.e. with uniform and parallel flow at exit,
secondly to find a short length profiles without modification of the
flow in the nozzle. The first elaborate program is used to determine
the profile of divergent by using the characteristics method for an
axisymmetric flow. The second program is conceived by using the
finite volume method to determine and test the profile found
connected to a convergent.
Abstract: In this paper, we present two new one-step iterative
methods based on Thiele-s continued fraction for solving nonlinear
equations. By applying the truncated Thiele-s continued fraction
twice, the iterative methods are obtained respectively. Analysis of
convergence shows that the new methods are fourth-order convergent.
Numerical tests verifying the theory are given and based on the
methods, two new one-step iterations are developed.