subject:(Direct solvers)

Rice University

1. Geldermans, Peter. Accelerated PDE Constrained Optimization using Direct Solvers.

Degree: MA, Engineering, 2018, Rice University

URL: http://hdl.handle.net/1911/105485

► In this thesis, I propose a method to reduce the cost of computing solutions to optimization problems governed by partial differential equations (PDEs). Standard second… (more)

Subjects/Keywords: PDE constrained optimization; direct solvers; fast solvers

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Geldermans, P. (2018). Accelerated PDE Constrained Optimization using Direct Solvers. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/105485

Chicago Manual of Style (16^th Edition):

Geldermans, Peter. “Accelerated PDE Constrained Optimization using Direct Solvers.” 2018. Masters Thesis, Rice University. Accessed April 17, 2021. http://hdl.handle.net/1911/105485.

MLA Handbook (7^th Edition):

Geldermans, Peter. “Accelerated PDE Constrained Optimization using Direct Solvers.” 2018. Web. 17 Apr 2021.

Vancouver:

Geldermans P. Accelerated PDE Constrained Optimization using Direct Solvers. [Internet] [Masters thesis]. Rice University; 2018. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/1911/105485.

Council of Science Editors:

Geldermans P. Accelerated PDE Constrained Optimization using Direct Solvers. [Masters Thesis]. Rice University; 2018. Available from: http://hdl.handle.net/1911/105485

King Abdullah University of Science and Technology

2. Chavez Chavez, Gustavo Ivan. Robust and scalable hierarchical matrix-based fast direct solver and preconditioner for the numerical solution of elliptic partial differential equations.

Degree: Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division, 2017, King Abdullah University of Science and Technology

URL: http://hdl.handle.net/10754/625172

► This dissertation introduces a novel fast direct solver and preconditioner for the solution of block tridiagonal linear systems that arise from the discretization of elliptic… (more)

▼ This dissertation introduces a novel fast direct solver and preconditioner for the solution of block tridiagonal linear systems that arise from the discretization of elliptic partial differential equations on a Cartesian product mesh, such as the variable-coefficient Poisson equation, the convection-diffusion equation, and the wave Helmholtz equation in heterogeneous media. The algorithm extends the traditional cyclic reduction method with hierarchical matrix techniques. The resulting method exposes substantial concurrency, and its arithmetic operations and memory consumption grow only log-linearly with problem size, assuming bounded rank of off-diagonal matrix blocks, even for problems with arbitrary coefficient structure. The method can be used as a standalone direct solver with tunable accuracy, or as a black-box preconditioner in conjunction with Krylov methods. The challenges that distinguish this work from other thrusts in this active field are the hybrid distributed-shared parallelism that can demonstrate the algorithm at large-scale, full three-dimensionality, and the three stressors of the current state-of-the-art multigrid technology: high wavenumber Helmholtz (indefiniteness), high Reynolds convection (nonsymmetry), and high contrast diffusion (inhomogeneity). Numerical experiments corroborate the robustness, accuracy, and complexity claims and provide a baseline of the performance and memory footprint by comparisons with competing approaches such as the multigrid solver hypre, and the STRUMPACK implementation of the multifrontal factorization with hierarchically semi-separable matrices. The companion implementation can utilize many thousands of cores of Shaheen, KAUST's Haswell-based Cray XC-40 supercomputer, and compares favorably with other implementations of hierarchical solvers in terms of time-to-solution and memory consumption. Advisors/Committee Members: Keyes, David E. (advisor), Moshkov, Mikhail (committee member), Ketcheson, David I. (committee member), Turkiyyah, George (committee member), Huang, Jingfang (committee member).

Subjects/Keywords: hierarchical matrices; cyclic reduction; fast solvers; Direct solvers; preconditioning; Parallel Computing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chavez Chavez, G. I. (2017). Robust and scalable hierarchical matrix-based fast direct solver and preconditioner for the numerical solution of elliptic partial differential equations. (Thesis). King Abdullah University of Science and Technology. Retrieved from http://hdl.handle.net/10754/625172

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Chavez Chavez, Gustavo Ivan. “Robust and scalable hierarchical matrix-based fast direct solver and preconditioner for the numerical solution of elliptic partial differential equations.” 2017. Thesis, King Abdullah University of Science and Technology. Accessed April 17, 2021. http://hdl.handle.net/10754/625172.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Chavez Chavez, Gustavo Ivan. “Robust and scalable hierarchical matrix-based fast direct solver and preconditioner for the numerical solution of elliptic partial differential equations.” 2017. Web. 17 Apr 2021.

Vancouver:

Chavez Chavez GI. Robust and scalable hierarchical matrix-based fast direct solver and preconditioner for the numerical solution of elliptic partial differential equations. [Internet] [Thesis]. King Abdullah University of Science and Technology; 2017. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/10754/625172.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chavez Chavez GI. Robust and scalable hierarchical matrix-based fast direct solver and preconditioner for the numerical solution of elliptic partial differential equations. [Thesis]. King Abdullah University of Science and Technology; 2017. Available from: http://hdl.handle.net/10754/625172

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

3. Schneider, Vanessa Andréia. Análise de modelos matemáticos para o problema de marketing direto com oferta de produtos.

Degree: 2019, Universidade Federal de Santa Maria; Centro de Tecnologia; Programa de Pós-Graduação em Engenharia de Produção; UFSM; Brasil; Engenharia de Produção

URL: http://repositorio.ufsm.br/handle/1/19106

►

The increasing complexity of modern business environments and the vast volume of data available make it necessary to use advanced models and computerized methods in… (more)

▼

The increasing complexity of modern business environments and the vast volume of data available make it necessary to use advanced models and computerized methods in organizations. With competitiveness increasing rapidly, organizations need to seek their differential and data are, often, the basis for calculations and simulations that support decision-making in a number of areas, including direct marketing. Direct marketing is a strategy that differentiates customers and exposes them to personalized information, seeking to supply individual needs and desires in the best possible way. The present research has the objective of analyze the behavior of mathematical models to solve the problem of direct marketing with product offer, whose purpose is to obtain the maximization of the problem, also considering the effect of cannibalism between products, comparing the quality of solutions obtained, GAP and computational time employed to obtain the results, thus, observing the performance of the commercial solver adopted. The method of study is based on Operational Research, especially in mathematical modeling. The mathematical models investigated, started from previous studies, exploring exact and heuristic methods to solve problems of direct marketing with offer of products. There were six executions of 324 instances for the problems No Cannibalism, M+, M+ Cannibalism, With Cannibalism, Dissimilarity and Similarity. The mathematical modeling in the Zimpl language generated LP files, later executed in the ILOG CPLEX Optimization Studio solver to solve the problems. The six exact methods performed in the present research, demonstrated good performance in the problems in which they were applied, since for the problem No Cannibalism 91.67% of the sets reached optimality, for the changes in the problem M+ Cannibalism and M+, 93.21% and 94.14% of the sets, respectively, obtained the optimal results. The problem With Cannibalism corresponded to 91.98% of optimal solutions, being that, the problem with Dissimilar pairs reached 95.37% and Similiridade 93.21%. The exact method applied proved be sufficient for the problems in question. It was verified the efficiency of the CPLEX solver for the problems already mentioned, since it provided the upper limits for all problems and in the majority, in the optimality, executing them in acceptable computational time. The files resulting from the application of the exact methods used in this research, are available at GitHub, aiming to foster new optimization research for problems of direct marketing with product offerings.

A crescente complexidade dos ambientes de negócios modernos e o vasto volume de dados disponíveis tornam necessário o uso de modelos avançados e métodos informatizados nas organizações. Com a competitividade aumentando de forma acelerada, as organizações necessitam buscar o seu diferencial e os dados são, muitas vezes, a base para cálculos e simulações que suportam a tomada de decisão em diversas áreas, incluindo o marketing direto. O…

Advisors/Committee Members: Müller, Felipe Martins, Garcia, Vinícius Jacques, Furtado, João Carlos.

Subjects/Keywords: Marketing direto; Otimização; Modelagem matemática; CPLEX; Direct marketing; Optimization; Mathematical modeling; Commercial solvers; CNPQ::ENGENHARIAS::ENGENHARIA DE PRODUCAO

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Schneider, V. A. (2019). Análise de modelos matemáticos para o problema de marketing direto com oferta de produtos. (Masters Thesis). Universidade Federal de Santa Maria; Centro de Tecnologia; Programa de Pós-Graduação em Engenharia de Produção; UFSM; Brasil; Engenharia de Produção. Retrieved from http://repositorio.ufsm.br/handle/1/19106

Chicago Manual of Style (16^th Edition):

Schneider, Vanessa Andréia. “Análise de modelos matemáticos para o problema de marketing direto com oferta de produtos.” 2019. Masters Thesis, Universidade Federal de Santa Maria; Centro de Tecnologia; Programa de Pós-Graduação em Engenharia de Produção; UFSM; Brasil; Engenharia de Produção. Accessed April 17, 2021. http://repositorio.ufsm.br/handle/1/19106.

MLA Handbook (7^th Edition):

Schneider, Vanessa Andréia. “Análise de modelos matemáticos para o problema de marketing direto com oferta de produtos.” 2019. Web. 17 Apr 2021.

Vancouver:

Schneider VA. Análise de modelos matemáticos para o problema de marketing direto com oferta de produtos. [Internet] [Masters thesis]. Universidade Federal de Santa Maria; Centro de Tecnologia; Programa de Pós-Graduação em Engenharia de Produção; UFSM; Brasil; Engenharia de Produção; 2019. [cited 2021 Apr 17]. Available from: http://repositorio.ufsm.br/handle/1/19106.

Council of Science Editors:

Schneider VA. Análise de modelos matemáticos para o problema de marketing direto com oferta de produtos. [Masters Thesis]. Universidade Federal de Santa Maria; Centro de Tecnologia; Programa de Pós-Graduação em Engenharia de Produção; UFSM; Brasil; Engenharia de Produção; 2019. Available from: http://repositorio.ufsm.br/handle/1/19106

University of Illinois – Urbana-Champaign

4. Cochran, William Kenneth. A Generic Data Structure with Parallel Applications.

Degree: PhD, Computer Science, 2009, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/13621

► High performance, massively-parallel multi-physics simulations are built on efficient mesh data structures. Most data structures are designed from the bottom up, focusing on the implementation… (more)

▼ High performance, massively-parallel multi-physics simulations are built on efficient mesh data structures. Most data structures are designed from the bottom up, focusing on the implementation of linear algebra routines. In this thesis, we explore a top-down approach to design, evaluating the various needs of many aspects of simulation, not just the implementation of a matrix-vector product. With this as motivation, we have developed a generic data structure that both provides efficient linear algebra subroutines by optimizing the computation at a fine-grained level and allows for rapid, reusable implementations of complex geometric algorithms. We demonstrate both through various experiments including directly measuring the efficiency of matrix-vector multiplication; implementation and analysis of a multi-frontal indefinite direct solver; approximation of the medial axis; and the development of a hybrid, two-phase mesh partitioner. The efficiency of matrix-vector multiplication is compared against a theoretical value derived from a simple model of computing hardware. The direct solver uses our data structure to remove a search step normally required for pivoting in indefinite solvers. We demonstrate that pairwise pivoting may have advantages over partial pivoting for ill-conditioned sparse matrices arising from meshes. We also present a novel, parallel algorithm that consistently approximates the medial axis of a domain of arbitrary dimension. By leveraging our data structure, a single implementation can be used for any type of mesh (\emph{e.g.}, 2-D, 3-D, space-time, or mixed element). Finally, we develop a hybrid approach to mesh partitioning in parallel. Using the medial axis of the mesh, large features are separated and partitioned independently using a geometric partitioner. In this way, complex domains are broken down into pieces that are better suited for geometric partitioning. Advisors/Committee Members: Heath, Michael T. (Committee Chair), Dodds, Robert H., Jr. (committee member), Erickson, Jeff G. (committee member), Kale, Laxmikant V. (committee member).

Subjects/Keywords: Parallel Computing; medial axis; indefinite direct solvers; mesh partitioning; parallel software engineering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Cochran, W. K. (2009). A Generic Data Structure with Parallel Applications. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/13621

Chicago Manual of Style (16^th Edition):

Cochran, William Kenneth. “A Generic Data Structure with Parallel Applications.” 2009. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 17, 2021. http://hdl.handle.net/2142/13621.

MLA Handbook (7^th Edition):

Cochran, William Kenneth. “A Generic Data Structure with Parallel Applications.” 2009. Web. 17 Apr 2021.

Vancouver:

Cochran WK. A Generic Data Structure with Parallel Applications. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2009. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/2142/13621.

Council of Science Editors:

Cochran WK. A Generic Data Structure with Parallel Applications. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2009. Available from: http://hdl.handle.net/2142/13621

5. Zhang, Yabin. A fast direct solver for boundary value problems with locally-perturbed geometries.

Degree: MA, Engineering, 2017, Rice University

URL: http://hdl.handle.net/1911/105467

► Many problems in science and engineering can be formulated as integral equations with elliptic kernels. In particular, in optimal control and design problems, the domain… (more)

Subjects/Keywords: fast direct solvers; boundary integral equations; local perturbation

…system as well as a more detailed discussion of one of the fast direct solvers, specifically… …the HBS solver. 6 Chapter 2 Fast Direct Solvers for BIEs The solver proposed in this… …and emphasizes the necessity of developing direct solvers for BIEs. Section 2.2 then… …is direct solvers. Besides good performance in terms of conditioning, direct solvers are… …requires matrix-vector multiplications. However, traditional direct solvers, such as Gaussian…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhang, Y. (2017). A fast direct solver for boundary value problems with locally-perturbed geometries. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/105467

Chicago Manual of Style (16^th Edition):

Zhang, Yabin. “A fast direct solver for boundary value problems with locally-perturbed geometries.” 2017. Masters Thesis, Rice University. Accessed April 17, 2021. http://hdl.handle.net/1911/105467.

MLA Handbook (7^th Edition):

Zhang, Yabin. “A fast direct solver for boundary value problems with locally-perturbed geometries.” 2017. Web. 17 Apr 2021.

Vancouver:

Zhang Y. A fast direct solver for boundary value problems with locally-perturbed geometries. [Internet] [Masters thesis]. Rice University; 2017. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/1911/105467.

Council of Science Editors:

Zhang Y. A fast direct solver for boundary value problems with locally-perturbed geometries. [Masters Thesis]. Rice University; 2017. Available from: http://hdl.handle.net/1911/105467

6. Ghaffari Dehkharghani, Seyed Amin. Simulations numériques d’écoulements incompressibles interagissant avec un corps déformable : application à la nage des poissons : Numerical simulation of incompressible flows interacting with forced deformable bodies : Application to fish swimming.

Degree: Docteur es, Mécanique et physique des fluides, 2014, Aix Marseille Université

URL: http://www.theses.fr/2014AIXM4369

►

Une méthode numérique précise et efficace est proposée pour la simulation de corps déformables interagissant avec un écoulement incompressible. Les équations de Navier-Stokes, considérées dans… (more)

▼

Une méthode numérique précise et efficace est proposée pour la simulation de corps déformables interagissant avec un écoulement incompressible. Les équations de Navier-Stokes, considérées dans leur formulation vorticité fonction de courant, sont discrétisées temporellement et spatialement à l'aide respectivement d'un schéma d'ordre 4 de Runge-Kutta et par des différences finies compactes. Grâce à l'utilisation d'un maillage uniforme, nous proposons un nouveau solveur direct au quatrième ordre pour l'équation de Poisson, permettant de garantir l'incompressibilité au zéro machine sur une grille optimale. L'introduction d'un corps déformable dans l'écoulement de fluide est réalisée au moyen d'une méthode de pénalisation de volume. La déformation du corps est imposée par l'utilisation d'un maillage lagrangien structuré mobile qui interagit avec le fluide environnant en raison des forces hydrodynamiques et du moment (calculés sur le maillage eulérien de référence). Une loi de contrôle efficace de la courbure d'un poisson anguilliforme nageant vers une cible prescrite est proposée. La méthode numérique développée prouve son efficacité et précision tant dans le cas de la nage du poisson mais aussi plus d'un grand nombre de problèmes d'interactions fluide-structure.

We present an efficient algorithm for simulation of deformable bodies interacting with two-dimensional incompressible flows. The temporal and spatial discretizations of the Navier – Stokes equations in vorticity stream-function formulation are based on classical fourth-order Runge – Kutta and compact finite differences, respectively. Using a uniform Cartesian grid we benefit from the advantage of a new fourth-order direct solver for the Poisson equation to ensure the incompressibility constraint down to machine zero over an optimal grid. For introducing a deformable body in fluid flow, the volume penalization method is used. A Lagrangian structured grid with prescribed motion covers the deformable body which is interacting with the surrounding fluid due to the hydrodynamic forces and the torque calculated on the Eulerian reference grid. An efficient law for controlling the curvature of an anguilliform fish, swimming toward a prescribed goal, is proposed which is based on the geometrically exact theory of nonlinear beams and quaternions. Validation of the developed method shows the efficiency and expected accuracy of the algorithm for fish-like swimming and also for a variety of fluid/solid interaction problems.

Advisors/Committee Members: Viazzo, Stéphane (thesis director), Schneider, Kai, Bernd (thesis director).

Subjects/Keywords: Ecoulements incompressibles; Différences finies compactes; Solveurs direct et itératifs; Ecoulements interagissant avec des corps déformables et mobiles; Méthode de frontière immergée; Filtrage par ondelette; Incompressible flow; Compact finite differences; Direct and Iterative solvers; Fluid interaction withmoving and deformable bodies; Immersed boundary method; Wavelet based filtering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ghaffari Dehkharghani, S. A. (2014). Simulations numériques d’écoulements incompressibles interagissant avec un corps déformable : application à la nage des poissons : Numerical simulation of incompressible flows interacting with forced deformable bodies : Application to fish swimming. (Doctoral Dissertation). Aix Marseille Université. Retrieved from http://www.theses.fr/2014AIXM4369

Chicago Manual of Style (16^th Edition):

Ghaffari Dehkharghani, Seyed Amin. “Simulations numériques d’écoulements incompressibles interagissant avec un corps déformable : application à la nage des poissons : Numerical simulation of incompressible flows interacting with forced deformable bodies : Application to fish swimming.” 2014. Doctoral Dissertation, Aix Marseille Université. Accessed April 17, 2021. http://www.theses.fr/2014AIXM4369.

MLA Handbook (7^th Edition):

Ghaffari Dehkharghani, Seyed Amin. “Simulations numériques d’écoulements incompressibles interagissant avec un corps déformable : application à la nage des poissons : Numerical simulation of incompressible flows interacting with forced deformable bodies : Application to fish swimming.” 2014. Web. 17 Apr 2021.

Vancouver:

Ghaffari Dehkharghani SA. Simulations numériques d’écoulements incompressibles interagissant avec un corps déformable : application à la nage des poissons : Numerical simulation of incompressible flows interacting with forced deformable bodies : Application to fish swimming. [Internet] [Doctoral dissertation]. Aix Marseille Université 2014. [cited 2021 Apr 17]. Available from: http://www.theses.fr/2014AIXM4369.

Council of Science Editors:

Ghaffari Dehkharghani SA. Simulations numériques d’écoulements incompressibles interagissant avec un corps déformable : application à la nage des poissons : Numerical simulation of incompressible flows interacting with forced deformable bodies : Application to fish swimming. [Doctoral Dissertation]. Aix Marseille Université 2014. Available from: http://www.theses.fr/2014AIXM4369

7. Lopez, Florent. Task-based multifrontal QR solver for heterogeneous architectures : Solveur multifrontal QR à base de tâches pour architectures hétérogènes.

Degree: Docteur es, Sureté du logiciel et calcul haute preformance, 2015, Université Toulouse III – Paul Sabatier

URL: http://www.theses.fr/2015TOU30303

►

Afin de s'adapter aux architectures multicoeurs et aux machines de plus en plus complexes, les modèles de programmations basés sur un parallélisme de tâche ont… (more)

▼

Afin de s'adapter aux architectures multicoeurs et aux machines de plus en plus complexes, les modèles de programmations basés sur un parallélisme de tâche ont gagné en popularité dans la communauté du calcul scientifique haute performance. Les moteurs d'exécution fournissent une interface de programmation qui correspond à ce paradigme ainsi que des outils pour l'ordonnancement des tâches qui définissent l'application. Dans cette étude, nous explorons la conception de solveurs directes creux à base de tâches, qui représentent une charge de travail extrêmement irrégulière, avec des tâches de granularités et de caractéristiques différentes ainsi qu'une consommation mémoire variable, au-dessus d'un moteur d'exécution. Dans le cadre du solveur qr mumps, nous montrons dans un premier temps la viabilité et l'efficacité de notre approche avec l'implémentation d'une méthode multifrontale pour la factorisation de matrices creuses, en se basant sur le modèle de programmation parallèle appelé "flux de tâches séquentielles" (Sequential Task Flow). Cette approche, nous a ensuite permis de développer des fonctionnalités telles que l'intégration de noyaux dense de factorisation de type "minimisation de cAfin de s'adapter aux architectures multicoeurs et aux machines de plus en plus complexes, les modèles de programmations basés sur un parallélisme de tâche ont gagné en popularité dans la communauté du calcul scientifique haute performance. Les moteurs d'exécution fournissent une interface de programmation qui correspond à ce paradigme ainsi que des outils pour l'ordonnancement des tâches qui définissent l'application. Dans cette étude, nous explorons la conception de solveurs directes creux à base de tâches, qui représentent une charge de travail extrêmement irrégulière, avec des tâches de granularités et de caractéristiques différentes ainsi qu'une consommation mémoire variable, au-dessus d'un moteur d'exécution. Dans le cadre du solveur qr mumps, nous montrons dans un premier temps la viabilité et l'efficacité de notre approche avec l'implémentation d'une méthode multifrontale pour la factorisation de matrices creuses, en se basant sur le modèle de programmation parallèle appelé "flux de tâches séquentielles" (Sequential Task Flow). Cette approche, nous a ensuite permis de développer des fonctionnalités telles que l'intégration de noyaux dense de factorisation de type "minimisation de cAfin de s'adapter aux architectures multicoeurs et aux machines de plus en plus complexes, les modèles de programmations basés sur un parallélisme de tâche ont gagné en popularité dans la communauté du calcul scientifique haute performance. Les moteurs d'exécution fournissent une interface de programmation qui correspond à ce paradigme ainsi que des outils pour l'ordonnancement des tâches qui définissent l'application.

To face the advent of multicore processors and the ever increasing complexity of hardware architectures, programming models based on DAG parallelism regained popularity in the high performance, scientific computing community.…

Advisors/Committee Members: Dayde, Michel (thesis director), Buttari, Alfredo (thesis director).

Subjects/Keywords: Méthodes directes de résolution de systèmes linéaires; Méthode multifrontale; Multicœur; Moteurs d'exécutions; Ordonnancement, algorithmes d'ordonnancement sous contraintes mémoire; Architectures hétérogènes; Calcul haute performance; GPU; Sparse direct solvers; Multifrontal method; Multicores; Runtime systems; Scheduling; Memory-aware algorythms; Heterogeneous architectures; High-performance computing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lopez, F. (2015). Task-based multifrontal QR solver for heterogeneous architectures : Solveur multifrontal QR à base de tâches pour architectures hétérogènes. (Doctoral Dissertation). Université Toulouse III – Paul Sabatier. Retrieved from http://www.theses.fr/2015TOU30303

Chicago Manual of Style (16^th Edition):

Lopez, Florent. “Task-based multifrontal QR solver for heterogeneous architectures : Solveur multifrontal QR à base de tâches pour architectures hétérogènes.” 2015. Doctoral Dissertation, Université Toulouse III – Paul Sabatier. Accessed April 17, 2021. http://www.theses.fr/2015TOU30303.

MLA Handbook (7^th Edition):

Lopez, Florent. “Task-based multifrontal QR solver for heterogeneous architectures : Solveur multifrontal QR à base de tâches pour architectures hétérogènes.” 2015. Web. 17 Apr 2021.

Vancouver:

Lopez F. Task-based multifrontal QR solver for heterogeneous architectures : Solveur multifrontal QR à base de tâches pour architectures hétérogènes. [Internet] [Doctoral dissertation]. Université Toulouse III – Paul Sabatier; 2015. [cited 2021 Apr 17]. Available from: http://www.theses.fr/2015TOU30303.

Council of Science Editors:

Lopez F. Task-based multifrontal QR solver for heterogeneous architectures : Solveur multifrontal QR à base de tâches pour architectures hétérogènes. [Doctoral Dissertation]. Université Toulouse III – Paul Sabatier; 2015. Available from: http://www.theses.fr/2015TOU30303

Pontifical Catholic University of Rio de Janeiro

8. [No author]. [pt] OTIMIZAÇÃO TOPOLÓGICA USANDO MALHAS POLIÉDRICAS.

Degree: 2019, Pontifical Catholic University of Rio de Janeiro

URL: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37112

►

[pt] A otimização topológica tem se desenvolvido bastante e possui potencial para revolucionar diversas áreas da engenharia. Este método pode ser implementado a partir de… (more)

▼

[pt] A otimização topológica tem se desenvolvido bastante e possui potencial para revolucionar diversas áreas da engenharia. Este método pode ser implementado a partir de diferentes abordagens, tendo como base o Método dos Elementos Finitos. Ao se utilizar uma abordagem baseada no elemento, potencialmente, cada elemento finito pode se tornar um vazio ou um sólido, e a cada elemento do domínio é atribuído uma variável de projeto, constante, denominada densidade. Do ponto de vista Euleriano, a topologia obtida é um subconjunto dos elementos iniciais. No entanto, tal abordagem está sujeita a instabilidades numéricas, tais como conexões de um nó e rápidas oscilações de materiais do tipo sólido-vazio (conhecidas como instabilidade de tabuleiro). Projetos indesejáveis podem ser obtidos quando elementos de baixa ordem são utilizados e métodos de regularização e/ou restrição não são aplicados. Malhas poliédricas não estruturadas naturalmente resolvem esses problemas e oferecem maior flexibilidade na discretização de domínios não Cartesianos. Neste trabalho investigamos a otimização topológica em malhas poliédricas por meio de um acoplamento entre malhas. Primeiramente, as malhas poliédricas são geradas com base no conceito de diagramas centroidais de Voronoi e posteriormente otimizadas para uso em análises de elementos finitos. Demonstramos que o número de condicionamento do sistema de equações associado pode ser melhorado ao se minimizar uma função de energia relacionada com a geometria dos elementos. Dada a qualidade da malha e o tamanho do problema, diferentes tipos de resolvedores de sistemas de equações lineares apresentam diferentes desempenhos e, portanto, ambos os resolvedores diretos e iterativos são abordados. Em seguida, os poliedros são decompostos em tetraedros por um algoritmo específico de acoplamento entre as malhas. A discretização em poliedros é responsável pelas variáveis de projeto enquanto a malha tetraédrica, obtida pela subdiscretização da poliédrica, é utilizada nas análises via método dos elementos finitos. A estrutura modular, que separa as rotinas e as variáveis usadas nas análises de deslocamentos das usadas no processo de otimização, tem se mostrado promissora tanto na melhoria da eficiência computacional como na qualidade das soluções que foram obtidas neste trabalho. Os campos de deslocamentos e as variáveis de projeto são relacionados por meio de um mapeamento. A arquitetura computacional proposta oferece uma abordagem genérica para a solução de problemas tridimensionais de otimização topológica usando poliedros, com potencial para ser explorada em outras aplicações que vão além do escopo deste trabalho. Finalmente, são apresentados diversos exemplos que demonstram os recursos e o potencial da abordagem proposta.

[en] Topology optimization has had an impact in various fields and has the potential to revolutionize several areas of engineering. This method can be implemented based on the finite element method, and there are several approaches of choice. When using an element-based approach,…

Advisors/Committee Members: IVAN FABIO MOTA DE MENEZES, IVAN FABIO MOTA DE MENEZES.

Subjects/Keywords: [pt] METODO DOS ELEMENTOS FINITOS; [pt] METODOS DIRETOS E ITERATIVOS; [pt] MALHAS POLIEDRICAS; [pt] DIAGRAMA DE VORONOI; [pt] OTIMIZACAO TOPOLOGICA; [en] FINITE ELEMENT METHOD; [en] DIRECT AND ITERATIVE SOLVERS; [en] POLYHEDRAL MESHES; [en] VORONOI DIAGRAMS; [en] TOPOLOGY OPTIMIZATION

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

author], [. (2019). [pt] OTIMIZAÇÃO TOPOLÓGICA USANDO MALHAS POLIÉDRICAS. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37112

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

author], [No. “[pt] OTIMIZAÇÃO TOPOLÓGICA USANDO MALHAS POLIÉDRICAS.” 2019. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed April 17, 2021. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37112.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

author], [No. “[pt] OTIMIZAÇÃO TOPOLÓGICA USANDO MALHAS POLIÉDRICAS.” 2019. Web. 17 Apr 2021.

Vancouver:

author] [. [pt] OTIMIZAÇÃO TOPOLÓGICA USANDO MALHAS POLIÉDRICAS. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2019. [cited 2021 Apr 17]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37112.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

author] [. [pt] OTIMIZAÇÃO TOPOLÓGICA USANDO MALHAS POLIÉDRICAS. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2019. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=37112

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Delft University of Technology

9. Pari, M. Simulating quasi-brittle failure in structures using Sequentially Linear Methods: Studies on non-proportional loading, constitutive modelling, and computational efficiency.

Degree: 2020, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; urn:NBN:nl:ui:24-uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; ca17d04d-4c40-4856-97cd-8808ac641007 ; 10.4233/uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; urn:isbn:978-94-6366-331-1 ; urn:NBN:nl:ui:24-uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; http://resolver.tudelft.nl/uuid:ca17d04d-4c40-4856-97cd-8808ac641007

► Sequentially Linear Analysis (SLA) is a proven robust alternative to incremental-iterative solution methods in nonlinear finite element analysis (NLFEA) of quasi-brittle specimen. The core of… (more)

Subjects/Keywords: Sequentially Linear Analysis (SLA); Direct & Iterative linear solvers; Quasi-brittle fracture; Non-proportional loading; Pushover Analysis; Force-release method; 3D Fixed Smeared Crack model; Composite Interface model

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Pari, M. (2020). Simulating quasi-brittle failure in structures using Sequentially Linear Methods: Studies on non-proportional loading, constitutive modelling, and computational efficiency. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; urn:NBN:nl:ui:24-uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; ca17d04d-4c40-4856-97cd-8808ac641007 ; 10.4233/uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; urn:isbn:978-94-6366-331-1 ; urn:NBN:nl:ui:24-uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; http://resolver.tudelft.nl/uuid:ca17d04d-4c40-4856-97cd-8808ac641007

Chicago Manual of Style (16^th Edition):

Pari, M. “Simulating quasi-brittle failure in structures using Sequentially Linear Methods: Studies on non-proportional loading, constitutive modelling, and computational efficiency.” 2020. Doctoral Dissertation, Delft University of Technology. Accessed April 17, 2021. http://resolver.tudelft.nl/uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; urn:NBN:nl:ui:24-uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; ca17d04d-4c40-4856-97cd-8808ac641007 ; 10.4233/uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; urn:isbn:978-94-6366-331-1 ; urn:NBN:nl:ui:24-uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; http://resolver.tudelft.nl/uuid:ca17d04d-4c40-4856-97cd-8808ac641007.

MLA Handbook (7^th Edition):

Pari, M. “Simulating quasi-brittle failure in structures using Sequentially Linear Methods: Studies on non-proportional loading, constitutive modelling, and computational efficiency.” 2020. Web. 17 Apr 2021.

Vancouver:

Pari M. Simulating quasi-brittle failure in structures using Sequentially Linear Methods: Studies on non-proportional loading, constitutive modelling, and computational efficiency. [Internet] [Doctoral dissertation]. Delft University of Technology; 2020. [cited 2021 Apr 17]. Available from: http://resolver.tudelft.nl/uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; urn:NBN:nl:ui:24-uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; ca17d04d-4c40-4856-97cd-8808ac641007 ; 10.4233/uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; urn:isbn:978-94-6366-331-1 ; urn:NBN:nl:ui:24-uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; http://resolver.tudelft.nl/uuid:ca17d04d-4c40-4856-97cd-8808ac641007.

Council of Science Editors:

Pari M. Simulating quasi-brittle failure in structures using Sequentially Linear Methods: Studies on non-proportional loading, constitutive modelling, and computational efficiency. [Doctoral Dissertation]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; urn:NBN:nl:ui:24-uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; ca17d04d-4c40-4856-97cd-8808ac641007 ; 10.4233/uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; urn:isbn:978-94-6366-331-1 ; urn:NBN:nl:ui:24-uuid:ca17d04d-4c40-4856-97cd-8808ac641007 ; http://resolver.tudelft.nl/uuid:ca17d04d-4c40-4856-97cd-8808ac641007

Georgia Tech

10. Guney, Murat Efe. High-performance direct solution of finite element problems on multi-core processors.

Degree: PhD, Civil and Environmental Engineering, 2010, Georgia Tech

URL: http://hdl.handle.net/1853/34662

► A direct solution procedure is proposed and developed which exploits the parallelism that exists in current symmetric multiprocessing (SMP) multi-core processors. Several algorithms are proposed… (more)

Subjects/Keywords: Finite element method; High-performance computing; Multi-core; Direct sparse solvers; Fill-in reduction; Numerical analysis; Finite element method Computer programs; Finite element method Data processing; Algorithms

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Guney, M. E. (2010). High-performance direct solution of finite element problems on multi-core processors. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/34662

Chicago Manual of Style (16^th Edition):

Guney, Murat Efe. “High-performance direct solution of finite element problems on multi-core processors.” 2010. Doctoral Dissertation, Georgia Tech. Accessed April 17, 2021. http://hdl.handle.net/1853/34662.

MLA Handbook (7^th Edition):

Guney, Murat Efe. “High-performance direct solution of finite element problems on multi-core processors.” 2010. Web. 17 Apr 2021.

Vancouver:

Guney ME. High-performance direct solution of finite element problems on multi-core processors. [Internet] [Doctoral dissertation]. Georgia Tech; 2010. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/1853/34662.

Council of Science Editors:

Guney ME. High-performance direct solution of finite element problems on multi-core processors. [Doctoral Dissertation]. Georgia Tech; 2010. Available from: http://hdl.handle.net/1853/34662

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations