Results 21 to 30 of about 85,505,833 (256)
A convergence analysis of SOR iterative methods for linear systems with weak H-matrices
Open Mathematics, 2016 It is well known that SOR iterative methods are convergent for linear systems, whose coefficient matrices are strictly or irreducibly diagonally dominant matrices and strong H-matrices (whose comparison matrices are nonsingular M-matrices).
Zhang Cheng-yi +2 more
doaj +1 more source
Journal of Computational and Applied Mathematics, 2015 The paper studies the convergence of some parallel multisplitting block iterative methods for the solution of linear systems arising in the numerical solution of Euler equations. Some sufficient conditions for convergence are proposed. As special cases the convergence of the parallel block generalized AOR (BGAOR), the parallel block AOR (BAOR), the ...
Cheng-Yi Zhang +2 more
openaire +4 more sources
Finite-difference solutions of tenth-order boundary-value problems [PDF]
, 1994 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In this thesis finite difference methods are used to obtain numerical solutions for a class of high-order ordinary differential equations with applications ...
Siddiqui, Aijaz Ahmad
core +7 more sources
Two Iterative Methods for Solving Linear Interval Systems
Applied Computational Intelligence and Soft Computing, 2018 Conjugate gradient is an iterative method that solves a linear system Ax=b, where A is a positive definite matrix. We present this new iterative method for solving linear interval systems Ãx̃=b̃, where à is a diagonally dominant interval matrix, as ...
Esmaeil Siahlooei +1 more
doaj +1 more source
Comments on new iterative methods for solving linear systems
上海师范大学学报. 自然科学版, 2017 Some new iterative methods were presented by Du, Zheng and Wang for solving linear systems in [3], where it is shown that the new methods, comparing to the classical Jacobi or Gauss-Seidel method, can be applied to more systems and have faster ...
Wang Ke, Tan Lijun, Wang Shiheng
doaj +1 more source
New SOR-like methods for solving the Sylvester equation
Open Mathematics, 2014 We present new iterative methods for solving the Sylvester equation belonging to the class of SOR-like methods, based on the SOR (Successive Over-Relaxation) method for solving linear systems.
Kierzkowski Jakub
doaj +1 more source
On the application of Liao’s method for solving linear systems
Ain Shams Engineering Journal, 2013 In this paper, an analytical attitude is proposed for solving linear systems by Homotopy Analysis Method (HAM). On the basis of HAM we design new iterative methods. The convergence properties of the proposed method have been analyzed.
H. Saberi Najafi, S.A. Edalatpanah
doaj +1 more source
A Modified SSOR Preconditioning Strategy for Helmholtz Equations
Journal of Applied Mathematics, 2012 The finite difference method discretization of Helmholtz equations usually leads to the large spare linear systems. Since the coefficient matrix is frequently indefinite, it is difficult to solve iteratively.
Shi-Liang Wu, Cui-Xia Li
doaj +1 more source
Numerical Simulation of One-Phase Flow to Multi-Stage Hydraulically Fractured Horizontal Well [PDF]
Учёные записки Казанского университета: Серия Физико-математические науки, 2016 This paper presents a method of numerical simulation of one-phase flow near multi-stage fractured horizontal well in oil reservoir. Differential models for flows within reservoir and within fractures are formulated separately on the basis of Darcy's law.
M.R. Khamidullin
doaj
A preconditioned AOR iterative scheme for systems of linear equations with L-matrics
Open Mathematics, 2019 In this paper we investigate theoretically and numerically the new preconditioned method to accelerate over-relaxation (AOR) and succesive over-relaxation (SOR) schemes, which are used to the large sparse linear systems.
Wang Hongjuan
doaj +1 more source