7 results on '"Janna, Carlo"'
Search Results
2. CHRONOS: A GENERAL PURPOSE CLASSICAL AMG SOLVER FOR HIGH PERFORMANCE COMPUTING.
- Author
-
ISOTTON, GIOVANNI, FRIGO, MATTEO, SPIEZIA, NICOLÒ, and JANNA, CARLO
- Subjects
FUNCTION algebras ,PARTIAL differential equations ,FLUID dynamics ,PARALLEL computers ,LINEAR algebra ,HIGH performance computing - Abstract
The numerical simulation of physical systems has become in recent years a fundamental tool to perform analyses and predictions in several application fields, spanning from industry to the academy. As far as large-scale simulations are concerned, one of the most computationally expensive tasks is the solution of linear systems of equations arising from the discretization of the partial differential equations governing physical processes. This work presents Chronos, a collection of linear algebra functions specifically designed for the solution of large, sparse linear systems on massively parallel computers. Its emphasis is on modern, effective, and scalable Algebraic Multigrid (AMG) preconditioners for high performance computing (HPC). This work describes the numerical algorithms and the main structures of this software suite, especially from an implementation standpoint. Several numerical results arising from practical mechanics and fluid dynamics applications with hundreds of millions of unknowns are addressed and compared with other state-of-the-art linear solvers, proving Chronos's efficiency and robustness. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
3. A NOVEL ALGEBRAIC MULTIGRID APPROACH BASED ON ADAPTIVE SMOOTHING AND PROLONGATION FOR ILL-CONDITIONED SYSTEMS.
- Author
-
PALUDETTO MAGRI, VICTOR A., FRANCESCHINI, ANDREA, and JANNA, CARLO
- Subjects
ALGEBRAIC multigrid methods ,GENERALIZED inverses of linear operators ,ITERATIVE methods (Mathematics) - Abstract
The numerical simulation of modern engineering problems can easily incorporate millions or even billions of unknowns. In several applications, sparse linear systems with symmetric positive definite matrices need to be solved, and algebraic multigrid (AMG) methods represent common choices for the role of iterative solvers or preconditioners. The reason for their popularity relies on the fast convergence that these methods provide even in the solution of large size problems, which is a consequence of the AMG ability to reduce particular error components across their multilevel hierarchy. Despite carrying the name "algebraic," most of these methods still make assumptions on additional information other than the global assembled matrix, such as the knowledge of the operator's near kernel, which limits their applicability as black-box solvers. In this work, we introduce a novel AMG approach featuring the adaptive factored sparse approximate inverse (aFSAI) method as a flexible smoother, as well as three new approaches to adaptively compute the prolongation operator. We assess the performance of the proposed AMG through the solution of a set of model problems along with real-world engineering test cases. Moreover, we perform comparisons to other methods such as the aFSAI and BoomerAMG preconditioners, showing that our new method proves to be superior to the first strategy and comparable to the second one, if not better, as in the solution of linear elasticity models. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
4. A ROBUST MULTILEVEL APPROXIMATE INVERSE PRECONDITIONER FOR SYMMETRIC POSITIVE DEFINITE MATRICES.
- Author
-
FRANCESCHINI, ANDREA, PALUDETTO MAGRI, VICTOR ANTONIO, FERRONATO, MASSIMILIANO, and JANNA, CARLO
- Subjects
ROBUST control ,APPROXIMATION theory ,MATHEMATICAL symmetry ,DEFINITE integrals ,MATRICES (Mathematics) ,NUMBER theory - Abstract
The use of factorized sparse approximate inverse (FSAI) preconditioners in a standard multilevel framework for symmetric positive deFInite (SPD) matrices may pose a number of issues as to the deFIniteness of the Schur complement at each level. The present work introduces a robust multilevel approach for SPD problems based on FSAI preconditioning, which eliminates the chance of algorithmic breakdowns independently of the preconditioner sparsity. The multilevel FSAI algorithm is further enhanced by introducing descending and ascending low-rank corrections, thus giving rise to the multilevel FSAI with low-rank corrections (MFLR) preconditioner. The proposed algorithm is investigated in a number of test problems. The numerical results show that the MFLR preconditioner is a robust approach that can significantly accelerate the solver convergence rate preserving a good degree of parallelism. The possibly large set-up cost, mainly due to the computation of the eigenpairs needed by low-rank corrections, makes its use attractive in applications where the preconditioner can be recycled along a number of linear solves. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
5. A FACTORED SPARSE APPROXIMATE INVERSE PRECONDITIONED CONJUGATE GRADIENT SOLVER ON GRAPHICS PROCESSING UNITS.
- Author
-
BERNASCHI, MASSIMO, BISSON, MAURO, FANTOZZI, CARLO, and JANNA, CARLO
- Subjects
LINEAR operators ,PARALLEL algorithms ,GRAPHICS processing units ,ITERATIVE methods (Mathematics) ,NUMERICAL analysis - Abstract
Graphics Processing Units (GPUs) exhibit significantly higher peak performance than conventional CPUs. However, in general only highly parallel algorithms can exploit their potential. In this scenario, the iterative solution to sparse linear systems of equations could be carried out quite efficiently on a GPU as it requires only matrix-by-vector products, dot products, and vector updates. However, to be really effective, any iterative solver needs to be properly preconditioned and this represents a major bottleneck for a successful GPU implementation. Due to its inherent parallelism, the factored sparse approximate inverse (FSAI) preconditioner represents an optimal candidate for the conjugate gradient-like solution of sparse linear systems. However, its GPU implementation requires a nontrivial recasting of multiple computational steps. We present our GPU version of the FSAI preconditioner along with a set of results that show how a noticeable speedup with respect to a highly tuned CPU counterpart is obtained. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
6. THE USE OF SUPERNODES IN FACTORED SPARSE APPROXIMATE INVERSE PRECONDITIONING.
- Author
-
JANNA, CARLO, FERRONATO, MASSIMILIANO, and GAMBOLATI, GIUSEPPE
- Subjects
- *
SUPERCOMPUTERS , *ITERATIVE methods (Mathematics) , *APPROXIMATION theory , *FACTORIZATION , *NUMERICAL analysis - Abstract
In recent years the growing popularity of supercomputers has fostered the development of algorithms able to take advantage of the massive parallelism offered by multiple processors. Direct methods, though robust and computationally efficient, hardly exploit high degrees of parallelism. By contrast, Krylov methods preconditioned by Factored Sparse Approximate Inverses (FSAI) provide, at least in principle, a perfectly parallel approach but are often thwarted by an excessive set-up cost. In this paper we extend the concept of supernode from sparse LU factorizations to approximate inverses, and use it to accelerate the computation of an FSAI-type preconditioner. The numerical experiments on real-world problems show that the overall FSAI efficiency can be significantly increased while preserving its intrinsic parallelism. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
7. A robust adaptive algebraic multigrid linear solver for structural mechanics.
- Author
-
Franceschini, Andrea, Paludetto Magri, Victor A., Mazzucco, Gianluca, Spiezia, Nicolò, and Janna, Carlo
- Subjects
- *
STRUCTURAL mechanics , *LINEAR systems , *SATISFIABILITY (Computer science) , *COMPUTATIONAL complexity , *COMPUTER simulation , *PARALLEL programming - Abstract
The numerical simulation of structural mechanics applications via finite elements usually requires the solution of large-size linear systems, especially when accurate results are sought for derived variables, like stress or deformation fields. Such a task represents the most time-consuming kernel, and motivates the development of robust and efficient linear solvers for these applications. On the one hand, direct solvers are robust and easy to use, but their computational complexity in the best scenario is superlinear, which limits applicability according to the problem size. On the other hand, iterative solvers, in particular those based on algebraic multigrid (AMG) preconditioners, can reach up to linear complexity, but require more knowledge from the user for an efficient setup, and convergence is not always guaranteed, especially in ill-conditioned problems. In this work, we present a novel AMG method specifically tailored for ill-conditioned structural problems. It is characterized by an adaptive factored sparse approximate inverse (aFSAI) method as smoother, an improved least-squared based prolongation (DPLS) and a method for uncovering the near-null space that takes advantage of an already existing approximation. The resulting linear solver has been applied in the solution of challenging linear systems arising from real-world linear elastic structural problems. Numerical experiments prove the efficiency and robustness of the method and show how, in several cases, the proposed algorithm outperforms state-of-the-art AMG linear solvers. Even more important, the results show how the proposed method gives good results even assuming a default setup, making it fully adoptable also for non-expert users and commercial software. • An Adaptive AMG linear solver for ill-conditioned structural problems is presented. • Results on more than 10 realistic examples prove its robustness and high efficiency. • Its performance is comparable or superior to other renowned state-of-art solvers. • It does not require tuning of user-parameters to achieve excellent performances. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.