Zobrazeno 1 - 10
of 137
pro vyhledávání: '"D'AMBRA, PASQUA"'
In this paper, we propose some Chebyshev polynomials of the 1st-kind which produce optimal bound for a polynomial dependent constant involved in the AMG $V$-cycle error bound and do not require information about the spectrum of matrices. We formulate
Externí odkaz:
http://arxiv.org/abs/2407.09848
In this chapter, we describe the Parallel Sparse Computation Toolkit (PSCToolkit), a suite of libraries for solving large-scale linear algebra problems in an HPC environment. In particular, we focus on the tools provided for the solution of symmetric
Externí odkaz:
http://arxiv.org/abs/2406.19754
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems (2023)
We present and release in open source format a sparse linear solver which efficiently exploits heterogeneous parallel computers. The solver can be easily integrated into scientific applications that need to solve large and sparse linear systems on mo
Externí odkaz:
http://arxiv.org/abs/2303.02352
Publikováno v:
J. Supercomput 80, 13533-13556 (2024)
In this paper, we describe an upgrade of the Alya code with up-to-date parallel linear solvers capable of achieving reliability, efficiency and scalability in the computation of the pressure field at each time step of the numerical procedure for solv
Externí odkaz:
http://arxiv.org/abs/2210.16660
We consider here a cell-centered finite difference approximation of the Richards equation in three dimensions, averaging for interface values the hydraulic conductivity $K=K(p)$, a highly nonlinear function, by arithmetic, upstream, and harmonic mean
Externí odkaz:
http://arxiv.org/abs/2112.05051
In this paper we propose a new approach to detect clusters in undirected graphs with attributed vertices. We incorporate structural and attribute similarities between the vertices in an augmented graph by creating additional vertices and edges as pro
Externí odkaz:
http://arxiv.org/abs/2109.09367
Publikováno v:
SIAM Journal on Scientific Computing, 2021, 43(5), S679-S703
Linear solvers for large and sparse systems are a key element of scientific applications, and their efficient implementation is necessary to harness the computational power of current computers. Algebraic MultiGrid (AMG) preconditioners are a popular
Externí odkaz:
http://arxiv.org/abs/2006.16147
Publikováno v:
Computers & Mathematics with Applications, Volume 144, 2023, Pages 290-305
In this paper, we discuss the convergence of an Algebraic MultiGrid (AMG) method for general symmetric positive-definite matrices. The method relies on an aggregation algorithm, named \emph{coarsening based on compatible weighted matching}, which exp
Externí odkaz:
http://arxiv.org/abs/2001.09969
Publikováno v:
In Computers and Mathematics with Applications 15 August 2023 144:290-305
This paper proposes improving the solve time of a bootstrap AMG designed previously by the authors. This is achieved by incorporating the information, set of algebraically smooth vectors, generated by the bootstrap algorithm, in a single hierarchy by
Externí odkaz:
http://arxiv.org/abs/1907.04417