✦ LIBER ✦

Numerical experiments with ABS algorithms for linear systems on a parallel machine

✍ Scribed by M. Bertocchi

Publisher: Springer
Year: 1989
Tongue: English
Weight: 858 KB
Volume: 60
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00940343

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel ABS projection methods for line

Parallel ABS projection methods for linear and nonlinear systems with block arrowhead structure

✍ A. Galántai 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Parallel algorithms for generating combi

Parallel algorithms for generating combinatorial objects on linear processor arrays with reconfigurable bus systems

✍ P Thangavel 📂 Article 📅 1997 🏛 Indian Academy of Sciences 🌐 English ⚖ 430 KB

Simple numerical algorithms for the mode

Simple numerical algorithms for the mode superposition analysis of linear structural systems with non-proportional damping

✍ A. Ibrahimbegovic; E.L. Wilson 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 756 KB

An optimal and processor efficient paral

An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus system

✍ Min He; Xiaolong Wu; Si Qing Zheng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 513 KB

Comparison of three algorithms for solvi

Comparison of three algorithms for solving linearized systems of parallel excitation RF waveform design equations: Experiments on an eight-channel system at 3 Tesla

✍ Adam C. Zelinski; Lawrence L. Wald; Kawin Setsompop; Vijayanand Alagappan; Borja 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 577 KB

A linear time algorithm for computing th

A linear time algorithm for computing the most reliable source on a series-parallel graph with unreliable edges

✍ Charles J. Colbourn; Guoliang Xue 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 993 KB

Given a network with n vertices and m edges where each edge has an independent operational probability, we are interested in finding a vertex of the network whose expected number of reachable vertices is maximum. Such a vertex is called a most reliable source of the network. This problem was studied