Results 31 to 40 of about 3,479 (214)
Augmented GMRES‐type methods [PDF]
AbstractGMRES is a popular iterative method for the solution of large linear systems of equations with a square non‐symmetric matrix. The method generates a Krylov subspace in which an approximate solution is determined. We present modifications of the GMRES and the closely related RRGMRES methods that allow augmentation of the Krylov subspaces ...
James Baglama, Lothar Reichel
openaire +2 more sources
Using successive approximations for improving the convergence of GMRES method [PDF]
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
Multipreconditioned GMRES for simulating stochastic automata networks
Stochastic Automata Networks (SANs) have a large amount of applications in modelling queueing systems and communication systems. To find the steady state probability distribution of the SANs, it often needs to solve linear systems which involve their ...
Wen Chun +5 more
doaj +1 more source
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
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
Stabilizing randomized GMRES through flexible GMRES
We explore the use of flexible GMRES as an outer wrapper for sketched GMRES. Building on a new bound for the residual of FGMRES in terms of the residual of the preconditioner, we derive a practical randomized solver that requires very little parameter tuning, while still being efficient and robust in the sense of generating non-increasing residual ...
Stefan Güttel, John W. Pearson
openaire +2 more sources
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
ABSTRACT This study proposes a novel geometrically regularized gradient‐damage model for simulating dynamic mixed‐mode fracture in orthotropic materials with tension–compression asymmetry. In this model, a thermodynamic framework is formulated by incorporating damage dissipation into internal energy evolution, from which the constitutive relation and ...
Hui Li, Shanyong Wang
wiley +1 more source
Computational analysis to assess hemodynamic forces in descending thoracic aortic aneurysms
Abstract figure legend Left: Pre‐processing. First, we perform the segmentation of the Computer Tomography angiorgraphy (angio‐CT) scans of a healthy patient, obtaining the surface of a healthy thoracic aorta with a Type III aortic arch. Then, we build nine ideal configurations with Descending Thoracic Aortic Aneurysm (DTAA), varying the aortic arch ...
Francesca Duca +7 more
wiley +1 more source
Solid Mechanics Segregated Solver Acceleration With Jacobian‐Free Newton‐Krylov
ABSTRACT The segregated algorithm is a common approach for finite volumes solvers in solid mechanics, providing a memory‐efficient and straightforward implementation. Due to the inter‐coupling of the components through the source terms, it suffers from a slow convergence behavior in specific scenarios, such as geometries with significantly uneven ...
Andry Monlon +5 more
wiley +1 more source

