SEBSM-Based Iterative Method for Solving Large Systems of Linear Equations and Its Applications in Engineering Computation
From MaRDI portal
Publication:2972148
DOI10.1142/S0219876216500249zbMath1359.65048MaRDI QIDQ2972148
Shi-Zhang Huang, Zhichao Yuan, Jin-Xiu Hu, Jian Liu, Xiao-Wei Gao
Publication date: 7 April 2017
Published in: International Journal of Computational Methods (Search for Journal in Brave)
iterative method; system of linear equations; Gauss-Seidel; successive over relaxation; simultaneous elimination and back-substitution method (SEBSM)
65F10: Iterative numerical methods for linear systems
Related Items
Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems, Simulation of Plasma Microscopy Properties and Ion Beam–Plasma Interaction Processes in Plasmas by Using MIXKIP/RAPCAL/STOPP CODE
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- Modified Gauss-Seidel type methods and Jacobi type methods for Z-matrices
- Successive overrelaxation (SOR) and related methods
- Motivations and realizations of Krylov subspace methods for large sparse linear systems
- A novel reduced-basis method with upper and lower bounds for real-time computation of linear elasticity problems
- A SOLVER OF LINEAR SYSTEMS OF EQUATIONS (REBSM) FOR LARGE-SCALE ENGINEERING PROBLEMS