Results 31 to 40 of about 713 (182)
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
GMRES Convergence Bounds for Eigenvalue Problems [PDF]
Abstract The convergence of GMRES for solving linear systems can be influenced heavily by the structure of the right-hand side. Within the solution of eigenvalue problems via inverse iteration or subspace iteration, the right-hand side is generally related to an approximate invariant subspace of the linear system.
Freitag, Melina A. +2 more
openaire +6 more sources
Geometry Analysis of Two Photon Polymerized Microneedles—An Experimental and Simulated Approach
This research investigates the mechanical stability of hollow, two‐photon‐polymerized microneedles for drug delivery. In an experimental setup, a steel stamp gradually compresses 1000 μm‐tall microneedles while recording their force–deformation response.
Cordelia F. Wittemann +4 more
wiley +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
SCALABILITY ANALYSIS OF PARALLEL GMRES IMPLEMENTATIONS [PDF]
Abstract Applications involving large sparse nonsymmetric linear systems encourage parallel implementations of robust iterative solution methods, such as GMRES(k). Two parallel versions of GMRES(k) based on different data distributions and using Householder reflections in the orthogonalization phase are analyzed with respect to scalability (their ...
Donald C.S. Allison† +2 more
openaire +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
We consider solving a large-scale Lyapunov equation for a multi-agent system. As is well known, the Lyapunov equation can be solved by equivalently rewriting it as a system of linear equations.
Asuka Ohashi, Kiyotsugu Takaba
doaj +1 more source

