Results 51 to 60 of about 4,826 (176)
The Upper Bound for GMRES on Normal Tridiagonal Toeplitz Linear System
Journal of Mathematical Extension, 2015 The Generalized Minimal Residual method (GMRES) is often used to solve a large and sparse system Ax = b. This paper establishes error bound for residuals of GMRES on solving an N × N normal tridiagonal Toeplitz linear system.
R. Doostaki∗, A. Hadian, S. Azizi
doaj
A Weighted Simpler GMRES Algorithm [PDF]
, 2008 GMRES方法是求解大规模非对称稀疏线性方程组最常用的方法。在实际应用中，给出了许多对标准GMRES进行改进的算法，比如SimplerGMRES和WeightedGMRES。SimplerGMRES通过改进GMRES中基的生成过程，把求解最小二乘问题转化成求解上三角矩阵的线性方程组，避免了求解最小二乘问题，有效减小了算法的计算量，同时使算法保持较好的收敛性。WeightedGMRES则采用加权技术来加快GMRES方法的收敛速度。WeightedGMRES虽然有较快的收敛速度 ...
杨圣炜
core
气体物理Although high-order unstructured grid finite volume methods based on variational reconstruction offer advantages like high accuracy and computational efficiency, their iterative convergence robustness and speed significantly lag behind second-order ...
Hanyu ZHOU, Yuxin REN
doaj +1 more source
Using successive approximations for improving the convergence of GMRES method [PDF]
, 1998 summary:In this paper, our attention is concentrated on the GMRES method for the solution of the system $(I-T)x=b$ of linear algebraic equations with a nonsymmetric matrix.
Jan Zítko, Zítko, Jan
core +1 more source
Some observations on weighted GMRES [PDF]
, 2013 We investigate the convergence of the weighted GMRES method for solving linear systems. Two different weighting variants are compared with unweighted GMRES for three model problems, giving a phenomenological explanation of cases where weighting improves ...
Güttel, Stefan, Pestana, Jen
core +1 more source
GMRES-Accelerated ADMM for Quadratic Objectives [PDF]
SIAM Journal on Optimization, 2018 31 pages, 7 figures. Accepted for publication in SIAM Journal on Optimization (SIOPT)
Zhang, Richard Y, White, Jacob K
openaire +5 more sources
, 2022 The GMRES algorithm of Saad and Schultz (1986) is an iterative method for approximately solving linear systems $A{\bf x}={\bf b}$, with initial guess ${\bf x}_0$ and residual ${\bf r}_0 = {\bf b} - A{\bf x}_0$.
core
Generating Approximate Inverse Preconditioners for Sparse Matrices Using CUDA and GPGPU
Journal of Algorithms & Computational Technology, 2011 The problem of numerical solution of sparse matrix-based linear systems arises from many scientific applications. Iterative solvers and corresponding preconditioning techniques are usually adopted.
Shiming Xu +3 more
doaj +1 more source
Low synchronization GMRES algorithms
CoRR, 2018 Communication-avoiding and pipelined variants of Krylov solvers are critical for the scalability of linear system solvers on future exascale architectures. We present low synchronization variants of iterated classical (CGS) and modified Gram-Schmidt (MGS) algorithms that require one and two global reduction communication steps.
Kasia Swirydowicz +4 more
openaire +3 more sources
Um Método Newton-Inexato com Estratégia Híbrida para Globalização
Trends in Computational and Applied Mathematics, 2008 Neste trabalho, o objetivo é propor um algoritmo Newton-inexato com propriedade de convergência global para resolução de sistemas não-lineares. Para a globalização, propomos uma abordagem híbrida, envolvendo, além de busca linear,o método de regiões de ...
R.G. Begiato, M.A. Gomes Ruggiero
doaj +1 more source