𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithms for solving tensor product finite element equations

✍ Scribed by Randolph E. Bank

Book ID
105177557
Publisher
Springer-Verlag
Year
1978
Tongue
English
Weight
565 KB
Volume
31
Category
Article
ISSN
0029-599X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A fast algorithm for solving the tensor
A fast algorithm for solving the tensor product collocation equations
✍ Weiwei Sun; N.G. Zamani πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 509 KB

A fast algorithm is presentedfor solving the tensor product collocation equations (A, @ B,+B, @ A,)u = b, obtained from the discretization of the Poisson equation in a rectangular region by the collocation method. The Fast Fourier Transformation (FFT) algorithm is employed to achieve the above objec

On Efficient Parallel Algorithms for Sol
On Efficient Parallel Algorithms for Solving Set Recurrence Equations
✍ O.H. Ibarra; H. Wang; T. Jiang πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 545 KB

We present two EREW PRAM algorithms and one CREW PRAM algorithm for solving set recurrence equations of the type commonly used in dynamic programming solutions to many problems in pattern matching, sequence comparison, and language recognition. All three algorithms run in \(O\left(\log ^{2} n\right)