A novel parallel algorithm based on the Gram-Schmidt method for tridiagonal linear systems of equations
Summary: We introduce a new parallel algorithm based on the Gram-Schmidt orthogonalization method. This parallel algorithm can find almost exact solutions of tridiagonal systems of linear equations in an efficient way. The system of equations is partitioned proportional to number of processors, and each partition is solved by a processor with a minimum request from the other partitions' data. The considerable reduction in data communication between processors causes interesting speedup. The relationships between partitions approximately disappear if some columns are switched. Hence, the speed of computation increases, and the computational cost decreases. Consequently, obtained results show that the suggested algorithm is considerably scalable. In addition, this method of partitioning can significantly decrease the computational cost on a single processor and make it possible to solve greater systems of equations. To evaluate the performance of the parallel algorithm, speedup and efficiency are presented. The results reveal that the proposed algorithm is practical and efficient.
- scientific article; zbMATH DE number 624932
- scientific article; zbMATH DE number 4001307
- A parallel algorithm for solving tridiagonal linear systems
- Parallel minimal norm method for tridiagonal linear systems
- A parallel block overlapped partition un-communication algorithm for block diagonal dominant block tri-diagonal systems
- A Fast Direct Solution of Poisson's Equation Using Fourier Analysis
- A novel parallel algorithm based on the Gram-Schmidt method for tridiagonal linear systems of equations
- A Parallel Method for Tridiagonal Equations
- An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
- Communication-optimal parallel and sequential QR and LU factorizations
- Distributed Orthogonal Factorization: Givens and Householder Algorithms
- Explicit formula for the inverse of a tridiagonal matrix by backward continued fractions
- scientific article; zbMATH DE number 5793286 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Loss and Recapture of Orthogonality in the Modified Gram–Schmidt Algorithm
- Maximizing parallelism and minimizing synchronization with affine partitions
- Optimized cyclic reduction for the solution of linear tridiagonal systems on parallel computers
- Parallel Factorizations for Tridiagonal Matrices
- Parallel Gram-Schmidt orthogonalisation on a network of transputers
- Parallel QR factorization by Householder and modified Gram-Schmidt algorithms
- ScaLAPACK Users' Guide
- Solving large dense systems of linear equations on systems with virtual memory and with cache
- The loss of orthogonality in the Gram-Schmidt orthogonalization process
- The parallel QR factorization algorithm for tridiagonal linear systems
This page was built for publication: A novel parallel algorithm based on the Gram-Schmidt method for tridiagonal linear systems of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q624683)
