𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for the numerical detection of simplex overlap

✍ Scribed by M.L. Brodzik


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
301 KB
Volume
8
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Efficient algorithms for finding maximum
✍ Sumio Masuda; Kazuo Nakajima; Toshinobu Kashiwabara; Toshio Fujisawa πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 728 KB

Let F = { I , , 12,. . . , Z,,} be a finite family of closed intervals on the real line. Two intervals 4 and Ik in F are said to overlap each other if they intersect but neither one of them contains the other. A graph G = (V, E) is called an overlap graph for F if there is a one-to-one correspondenc

An algorithm for the detection of degene
✍ Wen-Miin Hwang; Yii-Wen Hwang πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 493 KB

A degenerate kinematic chain is a movable kinematic chain with rigid subchains. This paper presents an effective algorithm for the detection of degenerate kinematic chains based on the loop-decreasing method. Some theorems are proved, and the detection algorithm is proposed. A computer program is de

An algorithm for the numerical inversion
✍ Kumar, Surendra ;Shashi, ;PethΓΆ, Árpad πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 280 KB πŸ‘ 2 views

This paper presents an algorithm for obtaining the inverse of a tridiagonal matrix numerically. The algorithm does not require diagonal dominance in the matrix and is also computationally efficient.