Sparse and Parallel Matrix Computations.

Abstract

This thesis deals with four important matrix problems: the application of many variants of the conjugate gradient method for solving matrix equations, the solution of lower and upper bounds guadratic programs associated with M-matrices, the construction of a Block Lanczos method for computing the greatest singular values of a matrix, and the computation of the singular value decomposition of a matrix on the ILLIAC-IV computer. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1978
Accession Number
ADA065285

Entities

People

  • Franklin Tai-cheung Luk

Organizations

  • Stanford University

Tags

Communities of Interest

  • Air Platforms
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Chebyshev Polynomials
  • Computational Fluid Dynamics
  • Computational Science
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Differential Equations
  • Language
  • Linear Accelerators
  • Linear Algebra
  • Notation
  • Parallel Computing
  • Parallel Processing
  • Programming Languages
  • Quadratic Programming

Fields of Study

  • Mathematics

Readers

  • Computer Programming and Software Development.
  • Linear Algebra