Results 71 to 80 of about 713 (182)
Generating Approximate Inverse Preconditioners for Sparse Matrices Using CUDA and GPGPU
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
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.
Swirydowicz, Kasia +4 more
openaire +2 more sources
A Comparison of Coupling Strategies for 1D–3D Simulations of Coronary Hemodynamics
Various 1D–3D coupling strategies combining a one‐dimensional (1D) pulse wave propagation model with three‐dimensional (3D) computational fluid dynamics (CFD) were evaluated for numerous types of complex synthetic coronary lesion geometries. Steady‐state simulations driven by mean flow showed no discrepancy with transient simulations in predicting ...
P. L. J. Hilhorst +6 more
wiley +1 more source
Um Método Newton-Inexato com Estratégia Híbrida para Globalização
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
In this paper, we consider the concept of discretely divergence‐free finite elements (DDFFE) based on the Rannacher–Turek finite element pair to efficiently solve the three‐dimensional incompressible Navier–Stokes equations. For this purpose, we first define a spanning set of DDFFE functions and then characterize a set of basis functions for arbitrary ...
Christoph Lohmann
wiley +1 more source
Solution of Linear Systems by GMRES Method on Global Computing Platform
By making use of a very large amount of unexploited computing resources, grid computing achieves high throughput computing. We present a classical parallel method GMRES (m) to solve large sparse linear systems utilizing a lightweight GRID system XtremWeb.
Haiwu He +3 more
doaj +1 more source
A Framework for the Solution of Tree‐Coupled Saddle‐Point Systems
ABSTRACT We consider the solution of saddle‐point systems with a tree‐based block structure, introducing a parallelizable direct method for their solution. As our key contribution, we then propose several structure‐exploiting preconditioners to be used during applications of the GMRES algorithm and analyze their properties.
Christoph Hansknecht +3 more
wiley +1 more source
ABSTRACT In this work, we propose a novel preconditioned minimal residual method for a class of real, nonsymmetric multilevel block Toeplitz systems, which generalizes an ideal preconditioner established in [J. Pestana. Preconditioners for symmetrized Toeplitz and multilevel Toeplitz matrices. SIAM Journal on Matrix Analysis and Applications, 40(3):870–
Grigorios Tachyridis, Sean Y. Hon
wiley +1 more source
In this work, we proposed a dynamic inverse solution with spatio-temporal constraints of the nonlinear heat diffusion problem in 1D and 2D based on a regularized Gauss–Newton and Krylov subspace with a preconditioner.
Luis Fernando Alvarez-Velasquez +1 more
doaj +1 more source
Continuing from the works of Li et al. (2014), Li (2007), and Kincaid et al. (2000), we present more generalizations and modifications of iterative methods for solving large sparse symmetric and nonsymmetric indefinite systems of linear equations.
Jen-Yuan Chen +2 more
doaj +1 more source

