| dc.contributor.advisor |
David Darmofal. |
en_US |
| dc.contributor.author |
Diosady, Laslo Tibor |
en_US |
| dc.contributor.other |
Massachusetts Institute of Technology. Computation for Design and Optimization Program. |
en_US |
| dc.date.accessioned |
2008-02-27T20:47:18Z |
|
| dc.date.available |
2008-02-27T20:47:18Z |
|
| dc.date.copyright |
2007 |
en_US |
| dc.date.issued |
2007 |
en_US |
| dc.identifier.uri |
http://dspace.mit.edu/handle/1721.1/39326 |
en_US |
| dc.identifier.uri |
http://hdl.handle.net/1721.1/39326 |
|
| dc.description |
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2007. |
en_US |
| dc.description |
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. |
en_US |
| dc.description |
Includes bibliographical references (p. 69-72). |
en_US |
| dc.description.abstract |
A Newton-Krylov method is developed for the solution of the steady compressible Navier-Stokes equations using a Discontinuous Galerkin (DG) discretization on unstructured meshes. An element Line-Jacobi preconditioner is presented which solves a block tridiagonal system along lines of maximum coupling in the flow. An incomplete block-LU factorization (Block-ILU(O)) is also presented as a preconditioner, where the factorization is performed using a reordering of elements based upon the lines of maximum coupling used for the element Line-Jacobi preconditioner. This reordering is shown to be far superior to standard reordering techniques (Nested Dissection, One-way Dissection, Quotient Minimum Degree, Reverse Cuthill-Mckee) especially for viscous test cases. The Block-ILU(0) factorization is performed in-place and a novel algorithm is presented for the application of the linearization which reduces both the memory and CPU time over the traditional dual matrix storage format. A linear p-multigrid algorithm using element Line-Jacobi, and Block-ILU(O) smoothing is presented as a preconditioner to GMRES. |
en_US |
| dc.description.abstract |
(cont.) The coarse level Jacobians are obtained using a simple Galerkin projection which is shown to closely approximate the linearization of the restricted problem except for perturbations due to artificial dissipation terms introduced for shock capturing. The linear multigrid preconditioner is shown to significantly improve convergence in terms of the number of linear iterations as well as to reduce the total CPU time required to obtain a converged solution. A parallel implementation of the linear multi-grid preconditioner is presented and a grid repartitioning strategy is developed to ensure scalable parallel performance. |
en_US |
| dc.description.provenance |
Made available in DSpace on 2008-02-27T20:47:18Z (GMT). No. of bitstreams: 2
173400608.pdf: 533717 bytes, checksum: a4ef251f08c2042ca932c7e8acdd88ed (MD5)
173400608-MIT.pdf: 530002 bytes, checksum: 6d30d3fac4dd347ad5269859263aca08 (MD5)
Previous issue date: 2007 |
en |
| dc.description.statementofresponsibility |
by Laslo Tibor Diosady. |
en_US |
| dc.format.extent |
72 p. |
en_US |
| dc.language.iso |
eng |
en_US |
| dc.publisher |
Massachusetts Institute of Technology |
en_US |
| dc.rights |
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. |
en_US |
| dc.rights.uri |
http://dspace.mit.edu/handle/1721.1/39326 |
en_US |
| dc.rights.uri |
http://dspace.mit.edu/handle/1721.1/7582 |
|
| dc.subject |
Computation for Design and Optimization Program. |
en_US |
| dc.title |
A linear multigrid preconditioner for the solution of the Navier-Stokes equations using a discontinuous Galerkin discretization |
en_US |
| dc.type |
Thesis |
en_US |
| dc.description.degree |
S.M. |
en_US |
| dc.contributor.department |
Massachusetts Institute of Technology. Computation for Design and Optimization Program. |
en_US |
| dc.identifier.oclc |
173400608 |
en_US |
