scholarly journals Numerical approximation for the solution of linear sixth order boundary value problems by cubic B-spline

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
A. Khalid ◽  
M. N. Naeem ◽  
P. Agarwal ◽  
A. Ghaffar ◽  
Z. Ullah ◽  
...  

AbstractIn the current paper, authors proposed a computational model based on the cubic B-spline method to solve linear 6th order BVPs arising in astrophysics. The prescribed 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 6th order BVPs using cubic B-spline, but it also describes the estimated derivatives of 1st order to 6th order of the analytic solution at the same time. This novel technique has lesser computational cost than numerous other techniques and is second order convergent. To show the efficiency of the proposed method, four numerical examples have been tested. The results are described using error tables and graphs and are compared with the results existing in the literature.

Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 850
Author(s):  
Nasser Mikaeilvand ◽  
Zahra Noeiaghdam ◽  
Samad Noeiaghdam ◽  
Juan J. Nieto

The aim of this research is to apply a novel technique based on the embedding method to solve the n × n fuzzy system of linear equations (FSLEs). By using this method, the strong fuzzy number solutions of FSLEs can be obtained in two steps. In the first step, if the created n × n crisp linear system has a non-negative solution, the fuzzy linear system will have a fuzzy number vector solution that will be found in the second step by solving another created n × n crisp linear system. Several theorems have been proved to show that the number of operations by the presented method are less than the number of operations by Friedman and Ezzati’s methods. To show the advantages of this scheme, two applicable algorithms and flowcharts are presented and several numerical examples are solved by applying them. Furthermore, some graphs of the obtained results are demonstrated that show the solutions are fuzzy number vectors.


2020 ◽  
Vol 20 (4) ◽  
pp. 845-854
Author(s):  
SUAYIP YUZBASI ◽  
NURCAN BAYKUS SAVASANERIL

In this study, a collocation approach based on the Hermite polyomials is applied to solve the singularly perturbated delay differential eqautions by boundary conditions. By means of the matix relations of the Hermite polynomials and the derivatives of them, main problem is reduced to a matrix equation. And then, collocation points are placed in equation of the matrix. Hence, the singular perturbed problem is transformed into an algebraic system of linear equations. This system is solved and thus the coefficients of the assumed approximate solution are determined. Numerical applications are made for various values of N.


Symmetry ◽  
2019 ◽  
Vol 11 (7) ◽  
pp. 854 ◽  
Author(s):  
Mutaz Mohammad

In this paper, we present a new computational method for solving linear Fredholm integral equations of the second kind, which is based on the use of B-spline quasi-affine tight framelet systems generated by the unitary and oblique extension principles. We convert the integral equation to a system of linear equations. We provide an example of the construction of quasi-affine tight framelet systems. We also give some numerical evidence to illustrate our method. The numerical results confirm that the method is efficient, very effective and accurate.


Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1078 ◽  
Author(s):  
Asifa Tassaddiq ◽  
Aasma Khalid ◽  
Muhammad Nawaz Naeem ◽  
Abdul Ghaffar ◽  
Faheem Khan ◽  
...  

This study deals with the numerical solution of the non-linear differential equations (DEs) arising in the study of hydrodynamics and hydro-magnetic stability problems using a new cubic B-spline scheme (CBS). The main idea is that we have modified the boundary value problems (BVPs) to produce a new system of linear equations. The algorithm developed here is not only for the approximation solutions of the 10th order BVPs but also estimate from 1st derivative to 10th derivative of the exact solution as well. Some examples are illustrated to show the feasibility and competence of the proposed scheme.


2012 ◽  
Vol 2012 ◽  
pp. 1-18
Author(s):  
Jose Manuel Gimenez-Guzman ◽  
M. Jose Domenech-Benlloch ◽  
Vicent Pla ◽  
Jorge Martinez-Bauset ◽  
Vicente Casares-Giner

We present a novel technique to solve multiserver retrial systems with impatience. Unfortunately these systems do not present an exact analytic solution, so it is mandatory to resort to approximate techniques. This novel technique does not rely on the numerical solution of the steady-state Kolmogorov equations of the Continuous Time Markov Chain as it is common for this kind of systems but it considers the system in its Markov Decision Process setting. This technique, known as value extrapolation, truncates the infinite state space using a polynomial extrapolation method to approach the states outside the truncated state space. A numerical evaluation is carried out to evaluate this technique and to compare its performance with previous techniques. The obtained results show that value extrapolation greatly outperforms the previous approaches appeared in the literature not only in terms of accuracy but also in terms of computational cost.


2020 ◽  
Vol 21 (3) ◽  
Author(s):  
Grzegorz Gurgul ◽  
Marcin Los ◽  
Maciej Paszynski ◽  
Victor Calo

In this paper, we use the alternating direction method for isogeometric finite elements to simulate implicit dynamics. Namely, we focus on a parabolic problem and use B-spline basis functions in space and an implicit marching method to fully discretize the problem. We introduce intermediate time steps and separate our differential operator into a summation of the blocks, acting along a particular coordinate axis in the intermediate time steps. We show that the resulting stiffness matrix can be represented as a multiplication of two (in 2D) or three (in 3D) multi-diagonal matrices, each one with B-spline basis functions along the particular axis of the spatial system of coordinates. As a result of this algebraic transformations, we get a system of linear equations that can be factorized in linear $O(N)$ computational cost in every time step of the implicit method. We use our method to simulate the heat transfer problem. We demonstrate theoretically and verify numerically that our implicit method is unconditionally stable for heat transfer problems (i.e., parabolic). We conclude our presentation with a discussion on the limitations of the method.


2015 ◽  
Vol 740 ◽  
pp. 619-623
Author(s):  
Zi Zhi Lin ◽  
Si Hui Shu

The approximate merging of two adjacent B-spline surfaces into a B-spline surface is the core problem in data communication. A novel algorithm is presented in this paper to solve this problem. In this algorithm, we compute the merging error using L2 norm instead of the Euclidean norm, the process of merging is minimizing the approximate error and we only need solve a system of linear equations to get the final merging surface. In order to reduce the merging error, we add a weighed function on objective function to start the next merger; this function adds greater weight on where error is larger. After the next merger, the merging error will be significantly reduced. Finally, some examples are given to demonstrate the effectiveness and validity of the proposed algorithm.


2019 ◽  
Vol 68 (5) ◽  
pp. 1207-1232 ◽  
Author(s):  
Michael J. Price ◽  
Cindy L. Yu ◽  
David A. Hennessy ◽  
Xiaodong Du

Sign in / Sign up

Export Citation Format

Share Document