Abstract
Many engineering and scientific problems can be solved by linear methods, but non-trivial examples of these problems may require large amounts of memory to represent and even larger amounts of computing time to solve. As more degrees of freedom, n, are added to a problem, the growth in memory and processing time can be O(n2) and O(n3), respectively.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Derick Wood, Theory of Computation, John Wiley & Sons, New York, (1987).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Pinchback, R. (1993). Working with Large Matrices in Maple. In: Lee, T. (eds) Mathematical Computation with Maple V: Ideas and Applications. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0351-3_8
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0351-3_8
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6720-1
Online ISBN: 978-1-4612-0351-3
eBook Packages: Springer Book Archive