Glossary
- Eigenvalue/Eigenvector:
-
The fundamental entities that characterize any given matrix and can be obtained by finding the roots of the characteristic polynomial of the matrix or by iterative methods
- Social Network Analysis:
-
A research area in social and behavioral sciences that uses networks to represent and hence analyze social phenomena
- Iterative Method:
-
A procedure for solving a problem by generating a sequence of improving approximations to the true solution of the given problem
Definition
Eigenvalues and eigenvectors are fundamental concepts in linear algebra (Golub and Van Loan 2012; Golub and Vorst 2000) and are defined as follows:
Definition 1
Let A be an n-by-n real matrix (i.e., in \( {\mathbb{R}}^{n\times n} \)). If there exist a scalar \( \lambda \in \mathbb{C} \) and a nonzero vector \...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Arnoldi WE (1951) The principle of minimized iteration in the solution of the matrix eigenproblem. Q Appl Math 9:17–29, MATHMathSciNet
Austin D (2012) http://www.ams.org/samplings/feature-column/fcarc-pagerank. Accessed 17 Oct 2012
Francis J (1961) The QR transformation: a unitary analogue to the LR transformation, parts I and II. Comput J 4:265–272, 332–345, MATHMathSciNet
Golub GH, Van Loan CF (2012) Matrix computations, 4th edn. Johns Hopkins University Press, Baltimore
Golub GH, Vorst H (2000) Eigenvalue computation in the 20th century. J Comput Appl Math 123:35–65, MATHMathSciNet
Horn RA, Johnson CR (1985) Matrix analysis. Cambridge University Press, London, MATH
Householder AS (1958) Unitary triangularization of a nonsymmetric matrix. J ACM 5:339–342, MATHMathSciNet
Householder AS (1964) The theory of matrices in numerical analysis. Dover, New York, MATH
Kamvar S, Haveliwala T, Golub GH (2004) Adaptive methods for the computation of PageRank. Linear Algebra Appl 386:51–65, MATHMathSciNet
Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18:39–43, MATH
Newman MEJ (2009) Networks: an introduction. Oxford University Press, Oxford
Opsahl T, Agneessens F, Skvoretz J (2010) Node centrality in weighted networks: generalizing degree and shortest paths. Soc Network 32(3):245–251
Page L, Brin S, Motwani R, Winograd T (1998) The PageRank citation ranking: bringing order to the web. Stanford Digital Libraries Working Paper
Parlett BN (1980) The symmetric eigenvalue problem. Prentice-Hall, Englewood Cliffs, MATH
Saad Y (2003) Iterative methods for sparse linear systems, 2nd edn. SIAM, Philadelphia, MATH
Schur I (1909) On the characteristic roots of a linear substitution with an application to the theory of integral equations. Math Ann 66:488–510, MATHMathSciNet
Stewart GW (1973) Introduction to matrix computations. Academic, New York, MATH
Wilkinson JH (1965) The algebraic eigenvalue problem. Clarendon, Oxford, MATH
Yin J, Yin G, Ng M (2012) On adaptively accelerated Arnoldi method for computing PageRank. Numer Linear Algebra Appl 19(1):73–85, MATHMathSciNet
Acknowledgments
The work of the second author was supported in part by the Natural Science Foundation of Zhejiang Province and National Natural Science Foundation of China (Grant Nos. Y6110639, 11201422).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media LLC, part of Springer Nature
About this entry
Cite this entry
Chan, R.H., Qiu, Y., Yin, G. (2018). Iterative Methods for Eigenvalues/Eigenvectors. In: Alhajj, R., Rokne, J. (eds) Encyclopedia of Social Network Analysis and Mining. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-7131-2_148
Download citation
DOI: https://doi.org/10.1007/978-1-4939-7131-2_148
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-7130-5
Online ISBN: 978-1-4939-7131-2
eBook Packages: Computer ScienceReference Module Computer Science and Engineering