Spelling suggestions: "subject:"includeresidual method"" "subject:"minimumresistance method""
1 |
Inverse Heat Conduction problem of the Quenching a Rotary Cylinder by Multiple Water Impinging JetsUriarte Sabín, Leticia January 2021 (has links)
The thesis deals with solving the time dependent inverse heat conduction and heat transfer problem of the quenching process of a rotary solid cylinder by multiple impinging water jets. The development of such investigation consists of two parts that complement each other. As is the case of any scientific experiment, first of all, an initial hypothesis will be set to be demonstrated theoretically. The numerical validation is carried out with a series of artificial cooling curve data and sensitivity analyses in the inverse solution. Then, a series of recorded temperature data were implemented into the inverse solution to predict the surface heat transfer during the quenching process.The numerical study consists of the solution of a two-dimensional linear time dependent inverse heat conduction problem based on the Generalized Minimal Residual Method (GMRES). The inverse solution method is based on the solution of an iterative problem, validated by a set of artificial temperature data. Such solution allows the prediction of the surface temperature and heat flux distribution in the quenching process, making use of recorded internal temperatures of the specimen. In order to solve the problem, the Matlab and Comsol Multiphysics programs were used. The GMRES algorithm was written as Matlab code, while the computational domain was defined in Comsol Multiphysics. Moreover, both programs collaborated in the solution of the inverse problem. Once the problem was solved, a sensitivity analysis was carried out in order to study the dependence of the numerical result on various parameters and optimize the inverse solution setup for application of recorded experimental data.The validated inverse solution setup examined by the sensitivity analyses was used on a set of experimental data, allowing the demonstration of the initially proposed hypothesis. This sensitivity analyses were performed consecutively for different key parameters regarding the numerical definition of the problem. The values for the parameters were considered optimal when minimum values for the error of the predicted surface temperature were recorded. In this case, the analyzed parameters were the m-value, mesh cell size, effect of noise, initial quenching temperature and quenching cooling rate. The connection between the experimental and numerical studies is obvious, as the first oneprovides the latter with input data of the inner temperature data of the specimen for the solving of the inverse problem, as is the case of the practical application of the code developed in the present thesis, and the inverse solution is essential in order to predict thesurface temperature and heat flux that are key information in studying quenching systems.
|
2 |
On Methods for Solving Symmetric Systems of Linear Equations Arising in OptimizationOdland, Tove January 2015 (has links)
In this thesis we present research on mathematical properties of methods for solv- ing symmetric systems of linear equations that arise in various optimization problem formulations and in methods for solving such problems. In the first and third paper (Paper A and Paper C), we consider the connection be- tween the method of conjugate gradients and quasi-Newton methods on strictly convex quadratic optimization problems or equivalently on a symmetric system of linear equa- tions with a positive definite matrix. We state conditions on the quasi-Newton matrix and the update matrix such that the search directions generated by the corresponding quasi-Newton method and the method of conjugate gradients respectively are parallel. In paper A, we derive such conditions on the update matrix based on a sufficient condition to obtain mutually conjugate search directions. These conditions are shown to be equivalent to the one-parameter Broyden family. Further, we derive a one-to-one correspondence between the Broyden parameter and the scaling between the search directions from the method of conjugate gradients and a quasi-Newton method em- ploying some well-defined update scheme in the one-parameter Broyden family. In paper C, we give necessary and sufficient conditions on the quasi-Newton ma- trix and on the update matrix such that equivalence with the method of conjugate gra- dients hold for the corresponding quasi-Newton method. We show that the set of quasi- Newton schemes admitted by these necessary and sufficient conditions is strictly larger than the one-parameter Broyden family. In addition, we show that this set of quasi- Newton schemes includes an infinite number of symmetric rank-one update schemes. In the second paper (Paper B), we utilize an unnormalized Krylov subspace frame- work for solving symmetric systems of linear equations. These systems may be incom- patible and the matrix may be indefinite/singular. Such systems of symmetric linear equations arise in constrained optimization. In the case of an incompatible symmetric system of linear equations we give a certificate of incompatibility based on a projection on the null space of the symmetric matrix and characterize a minimum-residual solu- tion. Further we derive a minimum-residual method, give explicit recursions for the minimum-residual iterates and characterize a minimum-residual solution of minimum Euclidean norm. / I denna avhandling betraktar vi matematiska egenskaper hos metoder för att lösa symmetriska linjära ekvationssystem som uppkommer i formuleringar och metoder för en mängd olika optimeringsproblem. I första och tredje artikeln (Paper A och Paper C), undersöks kopplingen mellan konjugerade gradientmetoden och kvasi-Newtonmetoder när dessa appliceras på strikt konvexa kvadratiska optimeringsproblem utan bivillkor eller ekvivalent på ett symmet- risk linjärt ekvationssystem med en positivt definit symmetrisk matris. Vi ställer upp villkor på kvasi-Newtonmatrisen och uppdateringsmatrisen så att sökriktningen som fås från motsvarande kvasi-Newtonmetod blir parallell med den sökriktning som fås från konjugerade gradientmetoden. I den första artikeln (Paper A), härleds villkor på uppdateringsmatrisen baserade på ett tillräckligt villkor för att få ömsesidigt konjugerade sökriktningar. Dessa villkor på kvasi-Newtonmetoden visas vara ekvivalenta med att uppdateringsstrategin tillhör Broydens enparameterfamilj. Vi tar också fram en ett-till-ett överensstämmelse mellan Broydenparametern och skalningen mellan sökriktningarna från konjugerade gradient- metoden och en kvasi-Newtonmetod som använder någon väldefinierad uppdaterings- strategi från Broydens enparameterfamilj. I den tredje artikeln (Paper C), ger vi tillräckliga och nödvändiga villkor på en kvasi-Newtonmetod så att nämnda ekvivalens med konjugerade gradientmetoden er- hålls. Mängden kvasi-Newtonstrategier som uppfyller dessa villkor är strikt större än Broydens enparameterfamilj. Vi visar också att denna mängd kvasi-Newtonstrategier innehåller ett oändligt antal uppdateringsstrategier där uppdateringsmatrisen är en sym- metrisk matris av rang ett. I den andra artikeln (Paper B), används ett ramverk för icke-normaliserade Krylov- underrumsmetoder för att lösa symmetriska linjära ekvationssystem. Dessa ekvations- system kan sakna lösning och matrisen kan vara indefinit/singulär. Denna typ av sym- metriska linjära ekvationssystem uppkommer i en mängd formuleringar och metoder för optimeringsproblem med bivillkor. I fallet då det symmetriska linjära ekvations- systemet saknar lösning ger vi ett certifikat för detta baserat på en projektion på noll- rummet för den symmetriska matrisen och karaktäriserar en minimum-residuallösning. Vi härleder även en minimum-residualmetod i detta ramverk samt ger explicita rekur- sionsformler för denna metod. I fallet då det symmetriska linjära ekvationssystemet saknar lösning så karaktäriserar vi en minimum-residuallösning av minsta euklidiska norm. / <p>QC 20150519</p>
|
Page generated in 0.0434 seconds