• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Preconditioning techniques for all-at-once linear systems arising from advection diffusion equations

Lin, Xuelei 07 August 2020 (has links)
In this thesis, we mainly study preconditioning techniques for all-at-once linear systems arising from discretization of three types of time-dependent advection-diffusion equation: linear diffusion equation, constant-coefficients advection-diffusion equation, time-fractional sub-diffusion equation. The proposed preconditioners are used with Krylov subspace solvers. The preconditioner developed for linear diffusion equation is based on -circulant ap- proximation of temporal discretization. Diagonalizability, clustering of spectrum and identity-plus-low-rank decomposition are derived for the preconditioned matrix. We also show that generalized minimal residual (GMRES) solver for the preconditioned system has a linear convergence rate independent of matrix-size. The preconditioner for constant-coefficients advection-diffusion equation is based on approximating the discretization of advection term with a matrix diagonalizable by sine transform. Eigenvalues of the preconditioned matrix are proven to be lower and upper bounded by positive constants independent of discretization parameters. Moreover, as the preconditioner is based on spatial approximation, it is also applicable to steady-state problem. We show that GMRES for the preconditioned steady-state problem has a linear convergence rate independent of matrix size. The preconditioner for time-fractional sub-diffusion equation is based on approximat- ing the discretization of diffusion term with a matrix diagonalizable by sine transform. We show that the condition number of the preconditioned matrix is bounded by a constant independent of discretization parameters so that the normalized conjugate gradient (NCG) solver for the preconditioned system has a linear convergence rate independent of discretization parameters and matrix size. Fast implementations based on fast Fourier transform (FFT), fast sine transform (FST) or multigrid approximation are proposed for the developed preconditioners. Numerical results are reported to show the performance of the developed preconditioners
2

Preconditioning techniques for all-at-once linear systems arising from advection diffusion equations

Lin, Xuelei 07 August 2020 (has links)
In this thesis, we mainly study preconditioning techniques for all-at-once linear systems arising from discretization of three types of time-dependent advection-diffusion equation: linear diffusion equation, constant-coefficients advection-diffusion equation, time-fractional sub-diffusion equation. The proposed preconditioners are used with Krylov subspace solvers. The preconditioner developed for linear diffusion equation is based on -circulant ap- proximation of temporal discretization. Diagonalizability, clustering of spectrum and identity-plus-low-rank decomposition are derived for the preconditioned matrix. We also show that generalized minimal residual (GMRES) solver for the preconditioned system has a linear convergence rate independent of matrix-size. The preconditioner for constant-coefficients advection-diffusion equation is based on approximating the discretization of advection term with a matrix diagonalizable by sine transform. Eigenvalues of the preconditioned matrix are proven to be lower and upper bounded by positive constants independent of discretization parameters. Moreover, as the preconditioner is based on spatial approximation, it is also applicable to steady-state problem. We show that GMRES for the preconditioned steady-state problem has a linear convergence rate independent of matrix size. The preconditioner for time-fractional sub-diffusion equation is based on approximat- ing the discretization of diffusion term with a matrix diagonalizable by sine transform. We show that the condition number of the preconditioned matrix is bounded by a constant independent of discretization parameters so that the normalized conjugate gradient (NCG) solver for the preconditioned system has a linear convergence rate independent of discretization parameters and matrix size. Fast implementations based on fast Fourier transform (FFT), fast sine transform (FST) or multigrid approximation are proposed for the developed preconditioners. Numerical results are reported to show the performance of the developed preconditioners

Page generated in 0.0466 seconds