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 10 of 10 for “"multilevel algorithm"”.

  1. Efficient Iterative Methods for Saddle Point Problems

    … most preconditioners and iterative methods. A multilevel algorithm is proposed for the solution of such systems, which uses a novel technique for the construction of a basis for the space satisfying the constraints. The proposed algorithm achieves faster convergence on account of implicit …

    uiuc Repository record for Efficient Iterative Methods for Saddle Point Problems (opens in a new tab)

  2. A multilevel method for meshless solution of the poisson equation in heat transfer and fluid flow

    … In this thesis, we present a non-nested multilevel algorithm using the PHS-RBF meshless method for the soluution of the Poisson equation, which commonly arises in numerous heat transfer and fluid flow applications. The PHS-RBF discretization of the Poisson equation leads to a sparse set …

    uiuc Repository record for A multilevel method for meshless solution of the poisson equation in heat transfer and fluid flow (opens in a new tab)

  3. Multilevel algorithms for nonlinear equations and equality constrained optimization

    … constrained optimization problems by means of multilevel algorithms. The idea is to use the trust region strategy to globalize the Brent algorithms for solving nonlinear equations, and to extend them to algorithms for solving optimization problems. The new multilevel algorithm for nonlinear …

    rice Repository record for Multilevel algorithms for nonlinear equations and equality constrained optimization (opens in a new tab)

  4. An improved implementation of sparsity detection of sparse derivative matrices

    … of this research is to propose an efficient algorithm which can effectively detect and represent sparsity of unknown Jacobian matrices. Automated sparsity detection algorithms find an optimal or near-optimal solution, which reduces time and space complexity for large scale data. Our proposed …

    lethbridge Repository record for An improved implementation of sparsity detection of sparse derivative matrices (opens in a new tab)

  5. Rank-1 lattice rules for uncertainty quantification of partial differential equations with random input

    … can be achieved. The second study provides a multilevel extension to a lattice-based kernel approximation method for approximating solutions to PDEs with periodic random coefficients over the parametric domain. Full cost and error analysis (including regularity theory) is presented showing …

    unsw Repository record for Rank-1 lattice rules for uncertainty quantification of partial differential equations with random input (opens in a new tab)

  6. A first study on the infrared properties of holographic models of cosmology using lattice-quantum-field theory simulations.

    … We finally investigate the feasibility of using multilevel methods to reduce statistical noise in holographic dual two-point calculations. Holographic dualities necessitate correlator calculations to be done in the critical regime where the correlation length diverges. Through a novel study of …

    soton Download PDF for A first study on the infrared properties of holographic models of cosmology using lattice-quantum-field theory simulations. (opens in a new tab)

  7. Fast and scalable solvers for high-order hybridized discontinuous Galerkin methods with applications to fluid dynamics and magnetohydrodynamics

    … of domain decomposition, multigrid and multilevel solvers/preconditioners with an ultimate focus on simulating large scale problems in fluid dynamics and magnetohydrodynamics (MHD). First, we propose a domain decomposition based solver namely iterative HDG for partial differential …

    texas Repository record for Fast and scalable solvers for high-order hybridized discontinuous Galerkin methods with applications to fluid dynamics and magnetohydrodynamics (opens in a new tab)

  8. An experimental study of partitioning methods for large graphs

    … partition a graph: <em>single-level</em> and <em>multilevel,/em>. The main objective of this thesis is to present and examine experimentally the coarsening/partitioning “space”. There are several variables to consider to generate the experimental re-sults and some variables could take many values. …

    ut-knoxville Repository record for An experimental study of partitioning methods for large graphs (opens in a new tab)

  9. An investigation of multilevel refinement in routing and location problems

    Multilevel refinement is a collaborative hierarchical solution technique. The multilevel technique aims to enhance the solution process of optimisation problems by improving the asymptotic convergence in the quality of solutions produced by its underlying local search heuristics and/or improving …

    greenwich Download PDF for An investigation of multilevel refinement in routing and location problems (opens in a new tab)

  10. Πολυεπίπεδοι, πολυεπεξεργαστικοί αλγόριθμοι αεροδυναμικής βελτιστοποίησης στις στροβιλομηχανές

    … optimization methods, based on evolutionary algorithms, that perfectly suits to aerodynamic shape optimization problems. Based on the proposed methods, a generic optimization software (EASY software, http://velos0.Itt.mech.ntua.gr/EASY) is developed by laying emphasis on the minimization of …

    greece Repository record for Πολυεπίπεδοι, πολυεπεξεργαστικοί αλγόριθμοι αεροδυναμικής βελτιστοποίησης στις στροβιλομηχανές (opens in a new tab)