Shift-invert and other methods for computing inner eigenvalues often require the solution of linear systems. This may become a problem if the linear systems are very ill-conditioned and the matrix dimension precludes the use of direct solvers. Then eigensolvers with polynomial acceleration become particularly attractive because they avoid the solution of linear systems. We discuss techniques for increasing the efficiency of subspace iteration with polynomial filtering. These include reducing the polynomial degree by adapting Chebyshev-based filter functions, optimizing the size of the search space, and using tailored high-performance computational kernels.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Efficient subspace iteration with Chebyshev-type filtering


    Beteiligte:
    Lang, Bruno (Autor:in) / Krämer, Lukas (Autor:in) / Galgon, Martin (Autor:in) / Alvermann, Andreas (Autor:in) / Fehske, Holger (Autor:in) / Pieper, Andreas (Autor:in) / Hager, Georg (Autor:in) / Kreutzer, Moritz (Autor:in) / Shahzad, Faisal (Autor:in) / Wellein, Gerhard (Autor:in)

    Kongress:

    2016 ; Bordeaux, Frankreich


    Erscheinungsdatum :

    2016


    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Efficient Conjunction Assessment using Modified Chebyshev Picard Iteration

    Probe, Austin | British Library Conference Proceedings | 2015


    Picard Iteration, Chebyshev Polynomials and Chebyshev-Picard Methods: Application in Astrodynamics

    Junkins, John L. / Bani Younes, Ahmad / Woollands, Robyn M. et al. | Online Contents | 2013


    Picard Iteration, Chebyshev Polynomials and Chebyshev-Picard Methods: Application in Astrodynamics

    Junkins, John L. / Bani Younes, Ahmad / Woollands, Robyn M. et al. | Springer Verlag | 2013