Arrays and Linear Algebra

Clemens Heitzinger ()
Additional contact information
Clemens Heitzinger: Technische Universität Wien, Center for Artificial Intelligence and Machine Learning (CAIML) and Department of Mathematics and Geoinformation

Chapter Chapter 8 in Algorithms with JULIA, 2022, pp 153-226 from Springer

Abstract: Abstract Arrays are a multi-dimensional data structure and hence encompass the mathematical structures of vectors, matrices, and tensors. An important application of arrays is the numerical implementation of linear algebra. In certain applications, the majority of the entries of vectors or matrices are zero; in these situations, the sparse versions should be used instead of the dense ones. Operations on dense and sparse arrays are discussed in detail in this chapter, including those from linear algebra such as solving systems of linear equations, calculating the eigenvalues and eigenvectors of matrices, singular-value decomposition, and matrix factorizations.

Date: 2022
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-16560-3_8

Ordering information: This item can be ordered from
http://www.springer.com/9783031165603

DOI: 10.1007/978-3-031-16560-3_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().