; GHOh+'0HP|
$TU Delft Repository search results0TU Delft Repository search results (max. 1000)TU Delft LibraryTU Delft Library@]nJ@]nJ՜.+,0HPX`hp
x
WorksheetFeuilles de calcul
B=%r8X"1Calibri1Calibri1Calibri1
Calibri 83ffff̙̙3f3fff3f3f33333f33333.1TU Delft Repositoryg \+uuidrepository linktitleauthorcontributorpublication yearabstract
subject topiclanguagepublication type publisherisbnissnpatent
patent statusbibliographic noteaccess restrictionembargo datefaculty
departmentresearch group programmeprojectcoordinates)uuid:9cd6cf6f-004b-4393-b272-9704d5f34754Dhttp://resolver.tudelft.nl/uuid:9cd6cf6f-004b-4393-b272-9704d5f34754mPreconditioning Optimal Flow Control Problems Using Multilevel Sequentially Semiseparable Matrix ComputationsQiu, Y.JVuik, C. (promotor); Van Gijzen, M.B. (promotor); Verhaegen, M. (promotor)-Optimal flow control problems are important for applications in science and engineering. Solving such problems usually requires the solution of a large linear generalized saddle-point system. This linear system is sparse and highly indefinite. In order to solve such systems using Krylov subspace methods, efficient preconditioners are necessary to enhance their robustness and accelerate the convergence. Standard block preconditioning techniques for the generalized saddle-point systems require an efficient approximation of the Schur complement. This is a big challenge since the Schur complement is large and dense, and therefore computationally expensive to approximate. For some problems, it is even impossible to approximate the Schur complement efficiently. In this dissertation, we propose a new class of preconditioners for optimal flow control problems using multilevel sequentially semiseparable (MSSS) matrix computations. In contrast to standard block preconditioners, MSSS preconditioners do not approximate the Schur complement of the generalized saddle-point system but compute an approximate factorization of the global block system in linear computational complexity. This is a big advantage over block preconditioners. The key to this global factorization is that the Schur complements in this factorization usually have low off-diagonal rank. Therefore, these Schur complements can be approximated by matrices with a low rank off-diagonal structure. For this, MSSS matrix computations are very well suited. Theoretical analysis shows that MSSS preconditioners yield a spectrum of the preconditioned system matrix that is contained in a circle centered at $(1, 0)$. This radius can be controlled arbitrarily by properly choosing a parameter in the MSSS preconditioner computations. This in turn implies that the convergence of MSSS preconditioned systems can be independent of the mesh size and regularization parameter for PDE-constrained optimization problems while for computational fluid dynamics problems, the convergence is independent of the mesh size and Reynolds number. Mesh size independent and wave number independent convergence can be also obtained when applying the MSSS preconditioning technique to the Helmholtz problem. Numerical results verify the convergence property. In this dissertation, we also studied the problem of optimal in-domain control of the Navier-Stokes equation. We use a simplified wind farm control example to formulate such a problem. Compared with standard PDE-constrained optimization problems where the controls are distributed throughout the whole domain, this in-domain control problem is even more difficult to solve since the control only acts on a few parts of the domain. This in turn gives a linear system of the generalized saddle-point type. Block preconditioners cannot give satisfactory performance for such problem because the Schur complement for such system is very difficult or even impossible to approximate efficiently. Applying MSSS preconditioners to this problem gives superior performance compared to block preconditioning techniques.preconditioning,; Krylov methods,; multilevel sequentially semiseparable matrices,; convergence analysis,; generalized saddle-point systems,; wind farm control,endoctoral thesis8Electrical Engineering, Mathematics and Computer Science&Delft Institute of Applied Mathematics)uuid:f107d33a-426d-4dfd-ba66-1bcaaee71274Dhttp://resolver.tudelft.nl/uuid:f107d33a-426d-4dfd-ba66-1bcaaee71274iEvaluation <
of Multilevel Sequentially Semiseparable Preconditioners on CFD Benchmark Problems Using IFISSEQiu, Y.; Van Gijzen, M.B.; Van Wingerden, J.; Verhaegen, M.; Vuik, C.This paper studies a new preconditioning technique for sparse systems arising from discretized partial differential equations (PDEs) in computational fluid dynamics (CFD), which exploit the multilevel sequentially semiseparable (MSSS) structure of the system matrix. MSSS matrix computations give a data-sparse way to approximate the LU factorization of a sparse matrix from discretized PDEs in linear computational complexity with respect to the problem size. In contrast to the standard block preconditioners, we exploit the global MSSS structure of the 2 by 2 block system from the discretized Stokes equation and linearized Navier-Stokes equation. This avoids the approximation of the Schur complement, which is a big advantage over standard block preconditioners. Numerical experiments on standard CFD benchmark problems in IFISS were carried out to evaluate the performance of the MSSS preconditioners. It was illustrated that the MSSS preconditioner yields mesh size independence convergence. Moreover, the convergence is almost insensitive to the viscosity parameter. Comparison with the algebraic multigrid (AMG) method and the geometric multigrid (GMG) method, the MSSS preconditioning technique is more robust than both the AMG method and the GMG method, and considerably faster than the AMG method.partial differential equations; multilevel sequentially semiseparable matrices; preconditioners; computational fluid dynamics; multigrid methodreportDelft University of Technology, Faculty of Electrical Engineering, Mathematics and Computer Science, Delft Institute of Applied Mathematics
*+&ffffff?'ffffff?(?)?"dXX333333?333333?U}}}}}}}}}} }
}}}
}}}}}}}}}}}}
|@
!
"
#
$
%
&t@
'
(
)
*
!
"
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~>@ddyKyKhttp://resolver.tudelft.nl/uuid:9cd6cf6f-004b-4393-b272-9704d5f34754yKyKhttp://resolver.tudelft.nl/uuid:f107d33a-426d-4dfd-ba66-1bcaaee71274gg
Root Entry F]nJ]nJ@SummaryInformation( F<Workbook F҆DocumentSummaryInformation8 F
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEF