Multigrid Algorithms for the Solution of Linear Complementarity Problems Arising from Free Boundary Problems.

Abstract

We show that the multigrid algorithms of Brandt can be adapted to solve linear complementarity problems arising from free boundary problems. The multigrid algorithms are significantly faster than previous algorithms. Using the multigrid algorithms, which are simple modifications of multigrid algorithms for equalities, it is possible to solve the difference equations to within truncation error using less work than the equivalent of six Gauss-Seidel sweeps on the finest grid. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1980
Accession Number
ADA096652

Entities

People

  • Achi Brandt
  • Colin Walker Cryer

Organizations

  • University of Wisconsin–Madison

Tags

Communities of Interest

  • C4I
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Boundary Value Problems
  • Computations
  • Computers
  • Difference Equations
  • Differential Equations
  • Equations
  • Inequalities
  • Journal Bearings
  • Mathematics
  • New York
  • Numerical Analysis
  • Sequences
  • Smoothing (Mathematics)
  • Truncation
  • United States

Readers

  • Computational Fluid Dynamics (CFD)
  • Operations Research