𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Comments on a simple algorithm for the plotting of contours

✍ Scribed by Singh, Chandan

Publisher
Wiley (John Wiley & Sons)
Year
1990
Tongue
English
Weight
225 KB
Volume
6
Category
Article
ISSN
0748-8025

No coin nor oath required. For personal study only.

✦ Synopsis

We consider a paper by about a new contour lines algorithm. Because of its exactness and its convincing straightforwardness we have tested it and incorporated it into our postprocessing software. This paper describes some aspects we experienced during the numerical experimentation which may be helpful for people considering using the method. Although the cited paper deals with both linearly interpolated isoparametric elements and quadratic ones we have restricted ourselves to the linear type to keep the relationships as simple as possible.

πŸ“œ SIMILAR VOLUMES

A simple algorithm for the time-optimal
A simple algorithm for the time-optimal control of chemical processes
✍ John N. Beard Jr.; Frank R. Groves Jr.; Adrain E. Johnson Jr. πŸ“‚ Article πŸ“… 1974 πŸ› American Institute of Chemical Engineers 🌐 English βš– 668 KB

## Abstract A simple algorithm for the time‐optimal control of chemical processes during setpoint changes, in processes which can be described by a second‐order lag plus dead time model, is described. Knowledge of the unsteady state model parameters is not required because the algorithm uses a dime

A Simple Parallel Algorithm for the Sing
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
✍ Jesper L. TrΓ€ff; Christos D. Zaroliagis πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 216 KB

We present a simple parallel algorithm for the single-source shortest path problem in planar digraphs with nonnegative real edge weights. The algorithm runs on the EREW PRAM model of parallel computation in O((n 2= +n 1&= ) log n) time, performing O(n 1+= log n) work for any 0<=<1Γ‚2. The strength of

Simple: A Methodology for Programming Hi
Simple: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs)
✍ David A. Bader; Joseph JΓ‘JΓ‘ πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 252 KB

We describe a methodology for developing high performance programs running on clusters of SMP nodes. The SMP cluster programming methodology is based on a small prototype kernel (Simple) of collective communication primitives that make efficient use of the hybrid shared and message-passing environme