Fast Algorithms for Structural Optimization, Least Squares and Other Computations.

Abstract

Fast algorithms for solving large-scale structural optimization and least squares problems are being investigated. An especially significant aspect of this work is the development and testing of parallel algorithms for alternatives to the often ill-conditioned stiffness equations approach in structural analysis on machines such as the Cray X-MP, the Denelcor HEP and the Intel Hypercube. The principal thrusts in this project on least squares methods have been in developing techniques for the solution of superlarge problems in a stable way, i.e., employing orthogonal factorization techniques, on multiprocessors. These computations involve various levels of parallelism, including domain decomposition as well as pipelining type schemes for orthogonal factorization. Additional keywords: linear algebra; parallel processing. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 19, 1985
Accession Number
ADA159136

Entities

People

  • R. J. Plemmons

Organizations

  • North Carolina State University

Tags

Communities of Interest

  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algebra
  • Algorithms
  • Classification
  • Computations
  • Computer Programs
  • Computers
  • Displacement
  • Equations
  • Illinois
  • Least Squares Method
  • Linear Algebra
  • Mathematics
  • Multiprocessors
  • Optimization
  • Parallel Computing
  • Parallel Processing
  • Structural Analysis

Fields of Study

  • Engineering

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Operations Research
  • Parallel and Distributed Computing.