Journal Article10.1080/00207169208804043
The strides reduction algorithms for solving tridiagonal linear systems
12
TL;DR: New Strides of 3 and 5 reduction algorithms are proposed for the solution of large linear systems of tridiagonal equations and the extensions to blocktridiagonal linear systems are discussed.
read more
Abstract: In this paper new Strides of 3 and 5 reduction algorithms are proposed for the solution of large linear systems of tridiagonal equations. The extensions to block tridiagonal linear systems are also discussed.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A specialised cyclic reduction algorithm for linear algebraic equation systems with quasi-tridiagonal matrices
TL;DR: In this article, the stride of two cyclic reduction method is extended to quasi-tridiagonal linear equation systems with two additional nonzero elements in the first and last rows of the equation matrix, adjacent to the main three diagonals.
Block iterative methods for the nine-point approximation to the convection-diffusion equation
Muddun Bhuruth,David J. Evans +1 more
TL;DR: The block successive overrelaxation and the block alternating group explicit (BLAGE) iterative methods are considered for solving the sparse unsymmetric linear system and it is shown that the line|ar system can be effectively solved by the block Gauss-Seidel method.
9
•Dissertation
Numerical solution of ordinary and partial differential equations occurring in scientific applications
Mohd. Idris Jayes
- 01 Jan 1992
TL;DR: In this paper, the numerical solutions of initial value problems with ordinary differential equations and boundary value problems involving partial differential equations were studied, where the solution of the boundary value problem was shown to be NP-hard.
8
The solution of periodic tridiagonal linear systems by the stride of 3 reduction algorithm
TL;DR: In this note a comparison of the odd/even and stride of 3 reduction algorithms is presented for a periodic tridiagonal linear system.
5
The solution of unsymmetric tridiagonal Toeplitz systems by the strides reduction algorithm
David J. Evans,W. S. Yousif +1 more
- 01 May 1994
TL;DR: The linear systems can be solved efficiently by the Stride of 3 reduction algorithm under a variety of boundary conditions.
3
References
A Fast Direct Solution of Poisson's Equation Using Fourier Analysis
TL;DR: This work has developed a direct method of solution involving Fourier analysis which can solve Poisson''s equation in a square region covered by a 48 x 48 mesh in 0.9 seconds on the IBM 7090.
715
Use of fast direct methods for the efficient numerical solution of nonseparable elliptic equations.
Paul Concus,Gene H. Golub +1 more
TL;DR: In this paper, an iterative technique for the numerical solution of strongly elliptic equations of divergence form in two dimensions with Dirichlet boundary conditions on a rectangle is proposed. But the problem is suitably scaled before iteration, and Chebyshev acceleration is applied to improve convergence.
196
On Direct Methods for Solving Poisson’s Equations
TL;DR: Some efficient and accurate direct methods are developed for solving certain elliptic partial difference equations over a rectangle with Dirichlet, Neumann or periodic boundary conditions.
The Direct Solution of the Discrete Poisson Equation on a Rectangle
TL;DR: In this article, the authors provide a survey of direct methods for solving finite difference equations with rectilinear domains. But the authors do not discuss whether the methods are easily adaptable to more general regions, and to general elliptic partial differential equations.