Results 31 to 40 of about 296,284 (267)
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
Вестник Дагестанского государственного технического университета: Технические науки, 2023 Objective. The purpose of this study was to create new pre-fabricated membrane-rod structures and non-linear methods for their calculation.Method. A stepwise method with an iterative numerical Euler-Cauchy procedure of the third order of accuracy was ...
A. Yu. Kim, S. V. Polnikov, M. F. Amoyan
doaj +1 more source
Convergence on Gauss-Seidel iterative methods for linear systems with general H-matrices
, 2014 It is well known that as a famous type of iterative methods in numerical linear algebra, Gauss-Seidel iterative methods are convergent for linear systems with strictly or irreducibly diagonally dominant matrices, invertible $H-$matrices (generalized ...
Luo, Shuanghua +3 more
core +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
Probabilistic Linear Solvers: A Unifying View
, 2018 Several recent works have developed a new, probabilistic interpretation for numerical algorithms solving linear systems in which the solution is inferred in a Bayesian framework, either directly or by inferring the unknown action of the matrix inverse ...
Bartels, Simon +3 more
core +1 more source
Parallel multigrid method for solving inverse problems
MethodsX, 2022 We considered in this work the linear operator equation and used the Landweber iterative method as an iterative solver. After that, we used the multigrid method as an optimization method for obtaining an approximation solution with a highly accurate and ...
H.K. Al-Mahdawi +5 more
doaj +1 more source
Non-iterative and exact method for constraining particles in a linear geometry
, 2004 We present a practical numerical method for evaluating the Lagrange multipliers necessary for maintaining a constrained linear geometry of particles in dynamical simulations.
Allen +12 more
core +1 more source
A boundary element formulation for the substation grounding design [PDF]
, 1999 [Abstract] A Boundary Element approach for the numerical computation of substation grounding systems is presented. In this general formulation, several widespread intuitive methods (such as Average Potential Method) can be identified as the result of ...
Casteleiro, Manuel +2 more
core +2 more sources
Krylov Subspace Solvers and Preconditioners
ESAIM: Proceedings and Surveys, 2018 In these lecture notes an introduction to Krylov subspace solvers and preconditioners is presented. After a discretization of partial differential equations large, sparse systems of linear equations have to be solved.
Vuik C.
doaj +1 more source
Towards Time-Limited $\mathcal H_2$-Optimal Model Order Reduction [PDF]
, 2017 In order to solve partial differential equations numerically and accurately, a high order spatial discretization is usually needed. Model order reduction (MOR) techniques are often used to reduce the order of spatially-discretized systems and hence ...
Goyal, Pawan, Redmann, Martin
core +3 more sources