𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Robust, Vectorized Search Algorithms for Interpolation on Unstructured Grids

✍ Scribed by Rainald Löhner

Book ID
102971293
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
590 KB
Volume
118
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

✦ Synopsis

Several search algorithms for the interpolation of data associated with unstructured grids are reviewed and compared. Particular emphasis is placed on the pitfalls these algorithms may experience for grids commonly encountered and on ways to improve their performance. It is shown how the most CPU-intensive portions of the search process may be vectorized. A technique for the proper interpolation of volumetric regions separated by thin surfaces is included. Timings for several problems show that speedups in excess of (1: 5) can be obtained if due care is used when designing interpolation algorithms. 1995 Academic Press, Inc.

📜 SIMILAR VOLUMES

Implicit/Multigrid Algorithms for Incomp
Implicit/Multigrid Algorithms for Incompressible Turbulent Flows on Unstructured Grids
✍ W.Kyle Anderson; Russ D. Rausch; Daryl L. Bonhaus 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 607 KB

ible codes in terms of both convergence rate and accuracy suffers greatly. In Ref. [54], Volpe demonstrated the poor An implicit code for computing inviscid and viscous incompressible flows on unstructured grids is described. The foundation of the performance of compressible flow codes under these c

Weighted Essentially Non-Oscillatory Sch
Weighted Essentially Non-Oscillatory Schemes for the Interpolation of Mean Values on Unstructured Grids
✍ Oliver Friedrich 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 390 KB

In this paper the weighted ENO (essentially non-oscillatory) scheme developed for the one-dimensional case by Liu, Osher, and Chan is applied to the case of unstructured triangular grids in two space dimensions. Ideas from Jiang and Shu, especially their new way of smoothness measuring, are consider

On the fast search algorithms for vector
On the fast search algorithms for vector quantization encoding
✍ Wen-Shiung Chen; Lili Hsieh; Shang-Yuan Yuan 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract One of the major difficulties arising in vector quantization (VQ) is high encoding time complexity. Based on the well‐known partial distance search (PDS) method and a special order of codewords in VQ codebook, two simple and efficient methods are introduced in fast full search vector qu