Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userComparison of Some LU-factorization Methods for Solving pentadiagonal Linear Systems of Equations
مقارنة بعض طرائق تحليل LU لحل جمل المعادلات الخطية خماسية الأقطار
2341
2 101
0
(
0
)
Authors
زكريا زكريا( باحث )
Created by
Shamra Editor
Ask ChatGPT about the research
قدمنا في هذا البحث لمحة عن جمل المعادلات الخطية خماسية الأقطار. علاوة على ذلك نعرض بإيجاز الطرائق المباشرة لحل جمل المعادلات الخطية خماسية الأقطار.
In this Searching scientific, , we introduced three methods for finding the solution of pentadiagonal linear systems of equations.
References used
D.C.Lay, Linear Algebra and its Applications, New York, 1994
Matthews , John "module for cholesky , Doolittle and Crout Factorization ".from numerical Analysis-numrical Methods project ,2006
Weisstein , Eric "LU Decomposition " from Math World-A Wolfram Web Resource, 2006
rate research
Read More
In this paper, we described tow parallel algorithms for finding the solution of
symmetric pentadiagonal linear systems of equations of order n . The proposed algorithms
require 2 processors; each of both possesses
N
O n local memor
y.
The first algorithm includes writing the pentadiagonal matrix in the form of product
of tow tridiagonal matrices. We suggested a parallel algorithm for solving tridiagonal
linear systems of equations. The second algorithm consists of decomposition of the
pentadiagonal matrix in a form such that we can carry out the resulting linear systems of
equations by using parallel algorithm. We carried out many numerical experiments to
illustrate the efficiency, speeding up and accuracy for solving symmetric pentadiagonal
linear systems of equations. The numerical experiments showed that the proposed
algorithms were efficient and one of both was much faster in factor of 2 than the other one
for solving the same test problems.
In this paper, we present two new methods for finding
the numerical solutions of systems of the nonlinear equations.
The basic idea depend on
founding relationship between minimum of a function and the
solution of systems of the nonlinear equatio
ns. The first method
seeks the numerical solution with a sequence of search
directions, which is depended on gradient and Hessian matrix of
function, while the second method is based on a sequence of
conjugate search directions. The study shows that our two
methods are convergent, and they can find exact solutions for
quadratic functions, so they can find high accurate solutions for
over quadratic functions. The purposed two algorithms are
programmed by Mathematica Version9. The approximate
solutions of some test problems are given. Comparisons of our
results with other methods illustrate the efficiency and highly
accurate of our suggested methods.
In this paper, we introduce a numerical method for solving systems of high-index differential algebraic equations. This method is based on approximating the exact solution by spline polynomial of degree eight with five collocation points to find the
numerical solution in each step. The study shows that the method when applied to linear differential-algebraic systems with index equal one is stable and convergent of order 8, while it is stable and convergent of order 9-u for index equal u .
Numerical experiments for four test examples and comparisons with other available results are given to illustrate the applicability and efficiency of the presented method
In this paper we consider the properties of linear systems by means of
directed graphs and numerical structures. We also state efficient algorithms
for determining an approximate number of the non-zero terms within
determinants' expressions of the
ir matrices. The stated algorithms make use of
trees representing numerical structures which contains the indices of the nonzero
terms.
This paper yields interesting results used in practical engineering
applications which include linear systems with sparse matrices, for example:
networks, electronic circuits, earth velocities boxes (gearboxes), multi-works
systems ...etc.
In this paper: the Daubechies families of wavelets Daubechies
and multi resolution analysis based on Fast Fourier Transform
algorithm (FWT) have been applied to solve some differential
equations with Boundary Value.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
