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 “"Parallel solution"”.

  1. A Parallel Solution-Adaptive Method for Turbulent Non-Premixed Combusting Flows

    A parallel adaptive mesh refinement (AMR) algorithm is proposed and applied to the predictions of turbulent non-premixed compressible combusting flows for both two and three space dimensions. The parallel solution-adaptive algorithm solves the system of partial-differential equations governing …

    toronto-retro Repository record for A Parallel Solution-Adaptive Method for Turbulent Non-Premixed Combusting Flows (opens in a new tab)

  2. ADMM Based Methods for Time-Domain Decomposition Formulations of Optimal Control Problems

    … (PDE)-constrained optimization problems. The solution of such optimization problems is computing time and memory intensive. TDD formulations split the time-dependent PDE into coupled subdomain equations and introduce potential for parallelism and global memory reduction. This thesis tailors …

    rice Repository record for ADMM Based Methods for Time-Domain Decomposition Formulations of Optimal Control Problems (opens in a new tab)

  3. Monolithic and partitioned Rosenbrock-based time integration methods for dynamic substructure tests

    … cases and partitioned methods with staggered and parallel solution procedures for linear and nonlinear cases. Initially, the Rosenbrock integration methods endowed with one stage to three stages are introduced and their applicabilities to second-order systems are investigated in terms of accuracy, …

    trento Repository record for Monolithic and partitioned Rosenbrock-based time integration methods for dynamic substructure tests (opens in a new tab)

  4. Recursive Bayesian Filtering Through a Mixture of Gaussian and Discrete Particles

    Conventional solutions to nonlinear filtering problems fall into two categories, deterministic and stochastic approaches. While the former is heavily used due to low computational demand, approximation error is tied to their initialization, which causes difficulty during long term application. The …

    queens Repository record for Recursive Bayesian Filtering Through a Mixture of Gaussian and Discrete Particles (opens in a new tab)

  5. Boundary method-based domain decomposition on multiprocessors

    … efficient method has been developed for the fast solution of the boundary problems of Poisson's equation on irregular as well as regular domains. The method, called the boundary method-based domain decomposition or BMDD, combines the attractiveness of the domain decomposition technique in parallel

    uiuc Repository record for Boundary method-based domain decomposition on multiprocessors (opens in a new tab)

  6. Smoothing Particle Hydrodynamics parallel implementation for numerical modelling of solid-fluid interactions

    In this work is presented an effcient parallel implementation of a Lagrangian mesh-free method based on the Smoothing Particle Hydrodynamics technique to analyse the behaviour of solids and fluids. The proposed solution makes use of different techniques to improve the computational complexity of …

    auckland-ms Repository record for Smoothing Particle Hydrodynamics parallel implementation for numerical modelling of solid-fluid interactions (opens in a new tab)

  7. MR-CUDASW - GPU accelerated Smith-Waterman algorithm for medium-length (meta)genomic data

    … Accordingly, this algorithm is the first highly parallel solution that has been specifically optimized to process medium-length nucleotide reads (DNA/RNA) from modern sequencing machines (i.e. Ion Torrent). Results show that the software reaches up to 82 GCUPS (Giga Cell Updates Per Second) on a …

    sask Repository record for MR-CUDASW - GPU accelerated Smith-Waterman algorithm for medium-length (meta)genomic data (opens in a new tab)

  8. Problém obchodního cestujícího - paralelní řešení na SMP (OpenMP)

    Práce porovná sériové a paralelní postupy řešení problému obchodního cestujícího. Používá některé známé heuristiky, které byly testovány po dobu několika desítek hodin. Algoritmy jsou porovnávány časovou a paměťovou složitostí. Bylo zjištěno, že paralelizace relativně malé části zdrojového kódu v …

    brno-tech Repository record for Problém obchodního cestujícího - paralelní řešení na SMP (OpenMP) (opens in a new tab)

  9. Domain decomposition preconditioners for higher-order discontinuous Galerkin discretizations

    … solver able to take advantage of the massively parallel architectures of modern day supercomputers. A higher-order hybridizable discontinuous Galerkin (HDG) discretization combined with an implicit solution method is proposed as a means to attain engineering accuracy at lower computational cost. …

    mit Repository record for Domain decomposition preconditioners for higher-order discontinuous Galerkin discretizations (opens in a new tab)

  10. Adjoint based solution and uncertainty quantification techniques for variational inverse problems

    … results fit the physical measurements.The solution procedure is computationally expensive since it involves running the simulation computer model (the emph{forward model}) and the associated emph {adjoint model} multiple times. In practice, our knowledge of the underlying physics is …

    vt Repository record for Adjoint based solution and uncertainty quantification techniques for variational inverse problems (opens in a new tab)