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"”.
-
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 …
-
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 …
-
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.
-
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 …
-
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. …
-
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 …
-
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
-
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, …
-
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 …
-
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 …
-
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
-
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 …
-
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 …
-
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 …
-
Application of distributed algebraic multigrid to nonlinear finite element analysis of geomechanics problems
Includes bibliographical references (pages 108-112).
-
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 …
-
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 …
-
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 …
-
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.
Page 1 of 4