Linear algebra on high performance computers (Q1093318): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Danny C. Sorensen / rank
Normal rank
 
Property / author
 
Property / author: Danny C. Sorensen / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: symrcm / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: EISPACK / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LINPACK / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998318713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-one modification of the symmetric eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Divide and Conquer method for the symmetric tridiagonal eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of some concurrent algorithms for matrix factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Squeezing the most out of eigenvalue solvers on high-performance computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix eigensystem routines. EISPACK guide extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error analysis of QR decompositions by Givens transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of sparse linear least squares problems using Givens rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5827285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Modified Matrix Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pipelined Givens method for computing the QR factorization of a sparse matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic Linear Algebra Subprograms for Fortran Usage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing by spline functions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing by spline functions. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Stable Parallel Linear System Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix eigensystem routines - EISPACK guide. 2nd ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Buffering for vector performance on a pipelined MIMD machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674306 / rank
 
Normal rank

Latest revision as of 11:54, 18 June 2024

scientific article
Language Label Description Also known as
English
Linear algebra on high performance computers
scientific article

    Statements

    Linear algebra on high performance computers (English)
    0 references
    0 references
    0 references
    1986
    0 references
    A survey is given of ways of constructing numerical software for high performance computers to handle linear algebra problems involving dense matrices. The focus is on utilization of new hardware rather than on the development of new algorithms. Typical recasting that occurs within LINPACK and EISPACK is described. Examples are presented in three areas: banded systems, sparse QR-factorization and symmetric eigenvalue problems.
    0 references
    parallel computation
    0 references
    survey
    0 references
    numerical software
    0 references
    high performance computers
    0 references
    dense matrices
    0 references
    LINPACK
    0 references
    EISPACK
    0 references
    banded systems
    0 references
    sparse QR- factorization
    0 references
    symmetric eigenvalue problems
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references