Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 63 for “"algebraic multigrid"”.

  1. Data parallel algebraic multigrid

    Algebraic multigrid methods for large, sparse linear systems are central to many computational simulations. Parallel algorithms for such solvers are generally decomposed into coarse-grain tasks suitable for distributed computers with traditional processing cores. Accelerating multigrid methods on …

    uiuc Repository record for Data parallel algebraic multigrid (opens in a new tab)

  2. Interpolation weights of algebraic multigrid

    Algebraic multigrid (AMG) is a numerical method used to solve particular algebraic systems, and interest in it has risen because of its multigrid-like efficiency. Variations in methodology during the interpolation phase result in differing convergence rates. We have found that regular interpolation …

    nps Repository record for Interpolation weights of algebraic multigrid (opens in a new tab)

  3. Algebraic Multigrid for Discrete Differential Forms

    … Our approach is based on the principles of algebraic multigrid (AMG) which is designed to solve large-scale linear systems with optimal, or near-optimal efficiency. Since the k-form problems to be solved are arbitrarily large, the need for scalable numerical solvers is clear.

    uiuc Repository record for Algebraic Multigrid for Discrete Differential Forms (opens in a new tab)

  4. Generalizing smoothed aggregation-based algebraic multigrid

    Smoothed aggregation-based (SA) algebraic multigrid (AMG) is a popular and effective solver for systems of linear equations that arise from discretized partial differential equations. While SA has been effective over a broad class of problems, it has several limitations and weaknesses that this …

    uiuc Repository record for Generalizing smoothed aggregation-based algebraic multigrid (opens in a new tab)

  5. Improving Coarsening and Interpolation for Algebraic Multigrid

    Algebraic multigrid (AMG) is one of the most efficient algorithms for solving large sparse linear systems on unstructured grids. Classical coarsening schemes such as the standard Ruge-Stüben method [14] can lead to adverse effects on computation time and memory usage that affect scalability. …

    waterloo Repository record for Improving Coarsening and Interpolation for Algebraic Multigrid (opens in a new tab)

  6. Efficient Setup Algorithms for Parallel Algebraic Multigrid

    The experimental results motivate the design of new coarsening algorithms to improve the performance of coarse-grid selection itself. A new algorithm labeled Bucket Sorted Independent Sets (BSIS) is developed and contributes two major advances. First, the cost of selecting independent sets while …

    uiuc Repository record for Efficient Setup Algorithms for Parallel Algebraic Multigrid (opens in a new tab)

  7. Learning aggregates and interpolation for algebraic multigrid

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-11 without embargo terms

    uiuc Repository record for Learning aggregates and interpolation for algebraic multigrid (opens in a new tab)

  8. Algebraic Multigrid for Markov Chains and Tensor Decomposition

    … and robust numerical methods based on adaptive algebraic multigrid to compute the stationary distribution of Markov chains. It is shown that classical algebraic multigrid techniques can be applied in an exact interpolation scheme framework to compute the stationary distribution of irreducible, …

    waterloo Repository record for Algebraic Multigrid for Markov Chains and Tensor Decomposition (opens in a new tab)

  9. Toward robust algebraic multigrid methods for nonsymmetric problems

    … problems and the methods for solving them, multigrid and algebraic multigrid in particular, one of the primary tools at the analyst's disposal is the energy norm associated with the problem. The lack of this tool is one of the many reasons analysis of nonsymmetric problems and methods for …

    oxford Repository record for Toward robust algebraic multigrid methods for nonsymmetric problems (opens in a new tab)

  10. Incorporating Algebraic Multigrid when Solving Reservoir Simulation Equations

    … the nearly elliptic pressure sub-system. An algebraic multigrid (AMG) method is used to efficiently solve the pressure system followed by an incomplete LU (ILU) technique as a robust second stage solver. The primary objective is to generate systems that are suitable for an efficient AMG …

    calgary Repository record for Incorporating Algebraic Multigrid when Solving Reservoir Simulation Equations (opens in a new tab)

  11. Optimization-based algebraic multigrid coarsening using reinforcement learning

    DSpace SAF Submission Ingestion Package generated from Vireo submission #16982 on 2022-01-12 at 12:46:07

    uiuc Repository record for Optimization-based algebraic multigrid coarsening using reinforcement learning (opens in a new tab)

  12. Performance of Algebraic Multigrid for Parallelized Finite Element DNS/LES Solvers

    The implementation of a hybrid spectral/finite-element discretization on the unsteady, incompressible, Navier-Stokes equations with a semi-implicit time-stepping method, an explicit treatment of the advective terms, and an implicit treatment of the pressure and viscous terms leads to an algorithm …

    byu Repository record for Performance of Algebraic Multigrid for Parallelized Finite Element DNS/LES Solvers (opens in a new tab) Download PDF for Performance of Algebraic Multigrid for Parallelized Finite Element DNS/LES Solvers (opens in a new tab)

  13. Analysis of an Aggregation-based Algebraic Multigrid Method and its Parallelization

    … analysis based on the paper [ \textit{Algebraic analysis of aggregation-based multigrid } by A. Napov and Y. Notay, Numer. Lin. Alg. Appl. 18 (2011), pp. 539-564 ] is derived for various aggregation schemes applied to a finite element discretization of a rotated anisotropic diffusion …

    washington Repository record for Analysis of an Aggregation-based Algebraic Multigrid Method and its Parallelization (opens in a new tab)

  14. A Parallel Aggregation Algorithm for Inter-Grid Transfer Operators in Algebraic Multigrid

    … parallel approaches to solve such problems. Multigrid methods can be used to solve large-scale problems, or even better they can be used to precondition the conjugate gradient method, yielding better results in general. Capabilities of multigrid algorithms rely on the effectiveness of the …

    vt Repository record for A Parallel Aggregation Algorithm for Inter-Grid Transfer Operators in Algebraic Multigrid (opens in a new tab)

  15. Improving the performance and scalability of algebraic multigrid solvers through applied performance modeling

    … new landscape. In this dissertation, we focus on algebraic multigrid (AMG), a popular linear solver with many scientific and engineering applications. AMG has the attractive property of requiring work that is linear in the number of unknowns. However, it also has substantial communication …

    uiuc Repository record for Improving the performance and scalability of algebraic multigrid solvers through applied performance modeling (opens in a new tab)

  16. Reducing communication in sparse solvers

    … relatively small non-zeros throughout an algebraic multigrid hierarchy, yielding significant reductions to the cost of sparse matrix-vector multiplication that outweigh affects of reduced accuracy of the multiplication. Therefore, the reduction in per-iteration communication costs outweigh …

    uiuc Repository record for Reducing communication in sparse solvers (opens in a new tab)

  17. PRECONDITIONING THE CONJUGATE GRADIENT METHOD FOR A HYBRIDIZED SUMMATION-BY-PARTS FINITE-DIFFERENCE DISCRETIZATION OF POISSON’S EQUATION WITH APPLICATION TO SEISMIC SIMULATIONS

    … schemes—Jacobi, incomplete Cholesky, and algebraic multigrid—at reducing the number of CG iterations required for convergence, finding that while all three preconditioners are effective, the latter two are superior. Code for all of our studies, written in the Julia programming language, is …

    nps Repository record for PRECONDITIONING THE CONJUGATE GRADIENT METHOD FOR A HYBRIDIZED SUMMATION-BY-PARTS FINITE-DIFFERENCE DISCRETIZATION OF POISSON’S EQUATION WITH APPLICATION TO SEISMIC SIMULATIONS (opens in a new tab)

  18. Machine learning techniques applied to preconditioning of linear systems

    … the entries for the prolongation operator in Algebraic Multigrid. The learned operator is tested on a difficult class of three-dimensional Poisson problems and shows an improvement over both standard operators and other machine learning operators from the literature.

    ttu Repository record for Machine learning techniques applied to preconditioning of linear systems (opens in a new tab)

Page 1 of 4