Results 71 to 80 of about 481 (184)
he distinctive paper is devoted to so-called multigrid (particularly two-grid) method of structural analysis based on discrete Haar basis (one-dimensional, two-dimensional and three-dimensional problems are under consideration).
Marina L. Mozgaleva +2 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
The efficiency comparison of solvers for sparse linear algebraic equations systems based on one of the fastest iterative methods, the BiCGStab method (bi-conjugate gradient method with stabilization), and the FGMRES method (flexible method of generalized
I. K. Marchevsky, V. V. Puzikova
doaj +1 more source
A review of algebraic multigrid
This paper (which seems to be a condensed version of the paper by the same author in the proceedings ``Multigrid'', Academic Press, N.Y., edited by U.\ Trottenberg et al. (2001; Zbl 0976.65106)) discusses and illustrates possibilities of algebraic multigrid algorithms for the solution of, e.g., heat conduction problems (with highly varying coefficients)
openaire +1 more source
Multilevel preconditioners for embedded enriched partition of unity approximations
In this paper we are concerned with the non-invasive embedding of enriched partition of unity approximations in classical finite element simulations and the efficient solution of the resulting linear systems.
Marc Alexander Schweitzer +1 more
doaj +1 more source
The structure and memory organization of graphics processor units (GPUs) manufactured by NVIDIA and the use of CUDA programming technology to solve computational fluid dynamics (CFD) problems is reviewed and discussed.
Redha Benhadj-Djilali +2 more
doaj +1 more source
A Theory of Relaxation-Based Algebraic Multigrid
Algebraic multigrid (AMG) methods derive their optimal efficiency from the interplay between a relaxation process and a corresponding coarse grid correction. In many standard formulations, relaxation and coarse-graining are analyzed and treated as largely separate of one another.
Rayan Moussa, Karsten Kahl
openaire +2 more sources
Notes on convergence of an algebraic multigrid method
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhaohui Huang, Peilin Shi
openaire +2 more sources
Multilevel Space-Time Aggregation for Bright Field Cell Microscopy Segmentation and Tracking
A multilevel aggregation method is applied to the problem of segmenting live cell bright field microscope images. The method employed is a variant of the so-called “Segmentation by Weighted Aggregation” technique, which itself is based on Algebraic ...
Tiffany Inglis +6 more
doaj +1 more source
Transactional Memory for Algebraic Multigrid Smoothers
This paper extends our early investigations in which we compared transactional memory to traditional OpenMP synchronization mechanisms [7, 8]. We study similar issues for algebraic multigrid (AMG) smoothers in hypre [16], a mature and widely used production-quality linear solver library.
Barna L. Bihari +3 more
openaire +2 more sources

