University of Birmingham > Talks@bham > Optimisation and Numerical Analysis Seminars > Preconditioned iterative methods for nonsymmetric Toeplitz and block Toeplitz matrices

Preconditioned iterative methods for nonsymmetric Toeplitz and block Toeplitz matrices

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Sergey Sergeev.

This talk has been canceled/deleted

Linear systems with nonsingular Toeplitz or block Toeplitz matrices arise in many applications, notably when discretizing partial differential, fractional differential or integral equations using constant time steps. These linear systems are amenable to solution by iterative methods, e.g., Krylov subspace methods, but to keep the number of iterations low preconditioning is typically required.

When the (block) Toeplitz matrix is symmetric, descriptive convergence theory guides the choice of preconditioner, but in the nonsymmetric case preconditioning is largely heuristic. In this talk we show how to symmetrize (block) Toeplitz matrices, so that the descriptive convergence theory for symmetric problems can be applied in order to design preconditioners that are guaranteed to be effective. Our numerical experiments validate the efficiency and robustness of the proposed approach.

This talk is part of the Optimisation and Numerical Analysis Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.