Results 31 to 40 of about 1,981 (210)
GMRES with multiple preconditioners [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Greif, Chen +2 more
openaire +1 more source
Residual-Based Simpler Block GMRES for Nonsymmetric Linear Systems with Multiple Right-Hand Sides
We propose in this paper a residual-based simpler block GMRES method for solving a system of linear algebraic equations with multiple right-hand sides. We show that this method is mathematically equivalent to the block GMRES method and thus equivalent to
Qinghua Wu, Liang Bao, Yiqin Lin
doaj +1 more source
On a method for calculating generalized normal solutions of underdetermined linear systems [PDF]
The article presents a novel algorithm for calculating generalized normal solutions of underdetermined systems of linear algebraic equations based on special extended systems.
Alexander Zhdanov, Yury Sidorov
doaj +1 more source
IGMRES method for linear systems [PDF]
The Index Generalized Minimal RESidual (IGMRES) algorithm is designed to compute the Drazin-inverse solution of a linear system of equations $Ax=b$, where $A$ is an arbitrary square matrix with index $\gamma$.
Faranges Kyanfar
doaj +1 more source
Computable Convergence Bounds for GMRES [PDF]
The purpose of this paper is to derive new computable convergence bounds for GMRES. The new bounds depend on the initial guess and are thus conceptually different from standard "worst-case" bounds. Most importantly, approximations to the new bounds can be computed from information generated during the run of a certain GMRES implementation.
openaire +3 more sources
GMRES is one of the most powerful and popular methods to solve linear systems in the Krylov subspace; we examine it from two viewpoints: to maximize the decreasing length of the residual vector, and to maintain the orthogonality of the consecutive ...
Chein-Shan Liu +2 more
doaj +1 more source
ILU preconditioning based on the FAPINV algorithm [PDF]
A technique for computing an ILU preconditioner based on the factored approximate inverse (FAPINV) algorithm is presented. We show that this algorithm is well-defined for H-matrices.
Davod Khojasteh Salkuyeh +2 more
doaj +1 more source
The aim of this paper is to propose some efficient and accurate numerical methods to compute the steady-state of variable coefficients space fractional Cahn-Allen equations.
Saleh Mousa Alzahrani +1 more
doaj +1 more source
Coupled Clustering in Hierarchical Matrices for the Oseen Problem
Fluid flow problems can be modelled by the Navier‐Stokes or, after linearization, by the Oseen equations. Their discretization results in linear systems in saddle point form which are typically very large and need to be solved iteratively. We propose a novel block structure for hierarchical matrices which is then used to build preconditioners for the ...
Jonas Grams, Sabine Le Borne
wiley +1 more source
Optimal control combines state and adjoint equations, which yield the state (x$$ x $$) and adjoint (lambda) variables as a function of the control variables (u$$ u $$). This structure allows us to design strategies for iteratively updating the control variable, based on conjugate gradient (CG) or GMRES algorithms.
N. Armengou‐Riera +4 more
wiley +1 more source

