Skip to main content

An ABS Method for Solving Suitably Structured Linear Systems is Supported by Parallel Architectures

  • Chapter
Parallel Processing Techniques for Simulation

Part of the book series: Applied Information Technology ((AITE))

  • 93 Accesses

Summary

We present an algorithm based on a method belonging to the class of Abaffy-Broyden-Spedicato [3]. The linear system to be solved can be sparse and in this situation must have a row-polychromatic structure.

Suggestions are given in order to exploit the high degree of freedom of the class, A suitable data structure reduces computation and memory requirements. The computations specified by the algorithm have a high degree of parallelism.

The computational complexity of the algorithm is discussed. Parallel architectures supporting the algorithm are examined.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Resta, An algorithm for the least squares solution of suitably structured linear systems. To appear.

    Google Scholar 

  2. P.E. Gill, W. Murray, Numerical methods for constrained optimization. Academic Press, (1974).

    Google Scholar 

  3. J. Abaffy, S. Broyden, E. Spedicato, A class of methods for linear equations II: Non-singular representation, parameter solution and other tales. Report IAM1.

    Google Scholar 

  4. L. Galli, G. Resta, Implementation of a data-flow algorithm for linear programming. Parallel Computing 83, Feilmeier, Joubert and Schendel, editors, Elsevier (1984).

    Google Scholar 

  5. G. Resta, The binary cube: a superstructure for super computers, Numerical Optimisation Centre T.R. 144, Hatfield Pol technic (U.K.), (1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Plenum Press, New York

About this chapter

Cite this chapter

Fragnelli, V., Resta, G. (1986). An ABS Method for Solving Suitably Structured Linear Systems is Supported by Parallel Architectures. In: Singh, M.G., Allidina, A.Y., Daniels, B.K. (eds) Parallel Processing Techniques for Simulation. Applied Information Technology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-5218-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-5218-1_7

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4684-5220-4

  • Online ISBN: 978-1-4684-5218-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics