✦ LIBER ✦

A Fast Algorithm to Compute the Wave-Scattering Solution of a Large Strip

✍ Scribed by W.C. Chew; C.C. Lu

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 373 KB
Volume: 107
Category: Article
ISSN: 0021-9991
DOI: 10.1006/jcph.1993.1152

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal algorithm to compute all the

An optimal algorithm to compute all the covers of a string

✍ Dennis Moore; W.F. Smyth 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 667 KB

An Algorithm to Compute the Kernel of a

An Algorithm to Compute the Kernel of a Derivation up to a Certain Degree

✍ Stefan Maubach 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 303 KB

A correction to “An optimal algorithm to

A correction to “An optimal algorithm to compute all the covers of a string”

✍ Dennis Moore; W.F. Smyth 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 265 KB

A new version of the program to compute

A new version of the program to compute the asymptotic solution of coupled equations for electron scattering

✍ Alfred T. Chivers 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 62 KB

Is the program overlaid? No No. of magnetic tapes required: None What other peripherals are used? Card reader, Line printer No. of cards in combined program and test deck: 1202

A Fast, High-Order Algorithm for the Sol

A Fast, High-Order Algorithm for the Solution of Surface Scattering Problems: Basic Implementation, Tests, and Applications

✍ Oscar P. Bruno; Leonid A. Kunyansky 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 255 KB

A BSP Recursive Divide and Conquer Algor

A BSP Recursive Divide and Conquer Algorithm to Compute the Inverse of a Tridiagonal Matrix

✍ Joan-Josep Climent; Leandro Tortosa; Antonio Zamora 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 253 KB

In this paper we discuss a recursive divide and conquer algorithm to compute the inverse of an unreduced tridiagonal matrix. It is based on the recursive application of the Sherman Morrison formula to a diagonally dominant tridiagonal matrix to avoid numerical stability problems. A theoretical study