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 408 for “"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. Multigrid methods for Maxwell's equations

    … Maxwell's equations and their solutions by multigrid algorithms. We begin with a brief survey of finite element methods for Maxwell's equations. Then we review the related fundamentals, such as Sobolev spaces, elliptic regularity results, graded meshes, finite element methods for second …

    lsu-thes Repository record for Multigrid methods for Maxwell's equations (opens in a new tab)

  3. 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)

  4. Iterative system modeling using multigrid techniques

    … identification and modeling algorithms utilizing multigrid techniques are presented. Finite impulse response (FIR), autoregressive (AR), infinite impulse response (IIR), and 2-D block matrix iterative system modeling algorithms are enhanced and made more efficient using the multigrid methods. The …

    nps Repository record for Iterative system modeling using multigrid techniques (opens in a new tab)

  5. Adaptive mesh refinement for Multigrid Solver

    … from Quarteroni is applied to solve the multigrid Poisson problem. This refinement is proven to be very efficient and effective compared with the uniform mesh refinement. Moreover, we propose a new estimator for the adaptive mesh refinement based on the error of approximate solution in …

    ttu Repository record for Adaptive mesh refinement for Multigrid Solver (opens in a new tab)

  6. Convergence Analysis of Segmental Refinement Multigrid

    In traditional multigrid, the number of unknowns on refined domains can create a memory bottleneck. The memory requirements can also reduce the efficiency of the algorithm due to the communication required between cores. I analyze Segmental Refinement Multigrid (SRMG) a modification to multigrid …

    rice Repository record for Convergence Analysis of Segmental Refinement Multigrid (opens in a new tab)

  7. Multigrid Algorithms for Massively Parallel Machines

    … methods of solving pde's is the use of the multigrid algorithm. However, the implementation of the multigrid algorithm on massively parallel machines is not very efficient because of (i) low processor utilization and (ii) high communication overheads. These problems need to be addressed to …

    odu Repository record for Multigrid Algorithms for Massively Parallel Machines (opens in a new tab)

  8. Algebraic Multigrid for Discrete Differential Forms

    … 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)

  9. 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)

  10. Monolithic multigrid for saddle point systems

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

    uiuc Repository record for Monolithic multigrid for saddle point systems (opens in a new tab)

  11. Robust structured multigrid at extreme scales

    … structure in a problem, robust structured multigrid methods gain important performance benefits because they preserve structure throughout the multigrid hierarchy. In parallel these methods benefit from nearest neighbor stencil-based communication patterns; however, the increased …

    uiuc Repository record for Robust structured multigrid at extreme scales (opens in a new tab)

  12. A multigrid Krylov method for eigenvalue problems.

    … eigenvalue problems based on Krylov subspaces. Multigrid methods solve differential equations by taking advantage of the hierarchy of discretizations. A multigrid Krylov method is proposed by combining Arnoldi and multigrid methods. We compare the new approach with other methods, and explore the …

    baylor Repository record for A multigrid Krylov method for eigenvalue problems. (opens in a new tab)

  13. Semiconductor device modelling using the multigrid method

    This thesis examines the application of the multigrid method to the semiconductor equations. An overview of semiconductor device modelling in presented, and the multi-grid method is described. Several modifications to the basic multigrid algorithm are evaluated based on their performance for a one …

    ubc Repository record for Semiconductor device modelling using the multigrid method (opens in a new tab) Download PDF for Semiconductor device modelling using the multigrid method (opens in a new tab)

  14. 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)

  15. Multigrid methods for elliptic optimal control problems

    … these optimality systems. This thesis studies multigrid methods for the solution of optimality systems arising in elliptic linear-quadratic optimal control problems. The formulation and application of multigrid methods are discussed. Their performance, both as an iterative method and as a …

    rice Repository record for Multigrid methods for elliptic optimal control problems (opens in a new tab)

  16. Multigrid Solution of the Debye-Hückel Equation

    Multigrid algorithms are fast solvers for elliptic partial differential equations. In this thesis, we apply multigrid methods to the model of protein charge-regulation of Hollenbeck, et al. The model of protein charge-regulation requires computing work of charging matrices for two low dielectric …

    rit Repository record for Multigrid Solution of the Debye-Hückel Equation (opens in a new tab)

  17. Multigrid Methods for Elliptic Optimal Control Problems

    In this dissertation we study multigrid methods for linear-quadratic elliptic distributed optimal control problems. For optimal control problems constrained by general second order elliptic partial differential equations, we design and analyze a $P_1$ finite element method based on a saddle point …

    lsu-thes Repository record for Multigrid Methods for Elliptic Optimal Control Problems (opens in a new tab)

Page 1 of 21