Report discusses application of Cholesky factorization algorithm to positive definite, banded Hermitian matrices. Begins by extending Cholesky factorization algorithm to cover uniformly-partitioned, banded, positive definite matrices of rank n that is real symmetric or Hermitian. Then two stratagems given for use of algorithm in concurrent-processing system in which N less than it has to be to enable factorization of matrix in as few serial steps as possible and where uniformly high efficiency expected from all processing elements. One of major purposes of this and related studies to maximize speedup and efficiency in system of concurrent-data-processing elements.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    Factorization Of Positive Definite, Banded Hermitian Matrices


    Beteiligte:
    Salama, Moktar A. (Autor:in) / Utku, Senol (Autor:in) / Melosh, Robert (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    1989-10-01



    Medientyp :

    Sonstige


    Format :

    Keine Angabe


    Sprache :

    Englisch





    Positive definite advection scheme

    Cullen, M. / CAS/JSC Working Group on Numerical Experimentation | British Library Conference Proceedings | 1996


    Asymptotic Spectra Of Banded Quasi-Toeplitz Matrices

    Beam, Richard / Warming, Robert | NTRS | 1995