On a Moving-Frame Algorithm and the Triangulation of Equilibrium Manifolds.

Abstract

Earlier a new algorithm was developed for computing vertices of a simplicial triangulation of subsets of a p-dimensional manifold M defined as the solution of a parametrized nonlinear equation. The algorithm depends on a method for constructing a moving frame on these subsets of M. Here an overview of these two algorithms is given together with some numerical examples that illustrate their effectiveness. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1986
Accession Number
ADA176179

Entities

People

  • Warner C. Rheinboldt

Organizations

  • University of Pittsburgh

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Aircrafts
  • Algorithms
  • Computational Science
  • Computations
  • Convergence
  • Coordinate Systems
  • Decomposition
  • Equations
  • High Angles
  • Mathematics
  • Military Research
  • New York
  • Numerical Analysis
  • Scientific Research
  • Triangulation

Fields of Study

  • Mathematics

Readers

  • Computational Fluid Dynamics (CFD)
  • Graph Algorithms and Convex Optimization.