1,720,962 research outputs found

    A GPU-accelerated adaptive FSAI preconditioner for massively parallel simulations

    Full text link
    The solution of linear systems of equations is a central task in a number of scientific and engineering applications. In many cases the solution of linear systems may take most of the simulation time thus representing a major bottleneck in the further development of scientific and technical software. For large scale simulations, nowadays accounting for several millions or even billions of unknowns, it is quite common to resort to preconditioned iterative solvers for exploiting their low memory requirements and, at least potential, parallelism. Approximate inverses have been shown to be robust and effective preconditioners in various contexts. In this work, we show how adaptive Factored Sparse Approximate Inverse (aFSAI), characterized by a very high degree of parallelism, can be successfully implemented on a distributed memory computer equipped with GPU accelerators. Taking advantage of GPUs in adaptive FSAI set-up is not a trivial task, nevertheless we show through an extensive numerical experimentation how the proposed approach outperforms more traditional preconditioners and results in a close-to-ideal behavior in challenging linear algebra problems

    On the construction of AMG prolongation through energy minimization

    Full text link
    Algebraic Multigrid (AMG) is a very popular iterative method used in several applications. This wide diffusion is due to its effectiveness in solving linear systems arising from PDEs discretization. The key feature of AMG is its optimality, i.e., the ability to guarantee a convergence rate independent of the mesh size for different problems. This is obtained through a good interplay between the smoother and the interpolation. Unfortunately, for difficult problems, such as those arising from structural mechanics or diffusion problems with large jumps in the coefficients, standard smoothers and interpolation techniques are not enough to ensure fast convergence. In these cases, an improved prolongation operator is required to enhance the AMG effectiveness. In this work, we present an updated prolongation according to an energy minimization criterion and show how this minimization can be seen as a constrained minimization problem. In detail, we have that the constraint is twofold: the prolongation must be sparse, and its range must represent the operator near-kernel. Even though energy minimization is well-known in the AMG community, it has little application due to both its cost and difficult implementation. Here, we would like to make energy minimization feasible through suitable preconditioned and effective implementation. In particular, to solve this problem, we propose two strategies: a restricted Krylov subspace iterative procedure and the null-space method. Both approaches can be preconditioned to speed up the setup time. Finally, thanks to some numerical experiments, we demonstrate how the convergence rate can be significantly increased at a reasonable setup cost

    Chronos: A general purpose classical amg solver for high performance computing

    Full text link
    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

    Robust numerical implementation of a 3D rate-dependent model for reservoir geomechanical simulations

    No full text
    A 3D elasto-plastic rate-dependent model for rock mechanics is formulated and implemented into a Finite Element (FE) numerical code. The model is based on the approach proposed by Vermeer and Neher (A soft soil model that accounts for creep. In: Proceedings of the International Symposium “Beyond 2000 in Computational Geotechnics,” pages 249-261, 1999). An original strain-driven algorithm with an Inexact Newton iterative scheme is used to compute the state variables for a given strain increment.The model is validated against laboratory measurements, checked on a simplified test case, and used to simulate land subsidence due to groundwater and hydrocarbon production. The numerical results prove computationally effective and robust, thus allowing for the use of the model on real complex geological settings

    A GENERAL-PURPOSE AMG LINEAR SOLVER FOR HIGH PERFORMANCE COMPUTING

    Full text link
    The numerical simulation of modern engineering problems via finite elements requires the solution of sparse linear systems of millions or even billions of unknowns. The algebraic multigrid (AMG) methods are the most common choice as linear solvers because of their fast convergence even for large-size problems. In this communication, we propose Chronos, a massively parallel implementation of a novel AMG framework, specifically designed to address complex problems by adapting its components, from the smoother, to the coarse grid correction and prolongation to the problem at hand. This work demonstrates not only the numerical performance of the proposed library, but also its robustness and adaptability to very challenging matrices, arising from different fields of application

    Going Beyond Counting First Authors in Author Co-citation Analysis

    Full text link
    The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed

    Variations on the Author

    Full text link
    “Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship

    Appropriate Similarity Measures for Author Cocitation Analysis

    Full text link
    We provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis

    Dispelling the Myths Behind First-author Citation Counts

    Full text link
    We conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more sophisticated methods
    corecore