<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/w/index.php?action=history&amp;feed=atom&amp;title=Intertemporal_portfolio_choice</id>
	<title>Intertemporal portfolio choice - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/w/index.php?action=history&amp;feed=atom&amp;title=Intertemporal_portfolio_choice"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Intertemporal_portfolio_choice&amp;action=history"/>
	<updated>2026-08-15T04:35:47Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.47.0-wmf.7</generator>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Intertemporal_portfolio_choice&amp;diff=30175&amp;oldid=prev</id>
		<title>en&gt;Duoduoduo: /* Age effects */ labor supply effect</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Intertemporal_portfolio_choice&amp;diff=30175&amp;oldid=prev"/>
		<updated>2013-11-08T14:00:29Z</updated>

		<summary type="html">&lt;p&gt;&lt;span class=&quot;autocomment&quot;&gt;Age effects: &lt;/span&gt; labor supply effect&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;In [[mathematics]], particularly in [[linear algebra]] and applications, &amp;#039;&amp;#039;&amp;#039;matrix analysis&amp;#039;&amp;#039;&amp;#039; is the study of [[matrix (mathematics)|matrices]] and their algebraic properties.&amp;lt;ref&amp;gt;{{cite book|title=Matrix Analysis|author=R. A. Horn, C. R. Johnson|year=2012|publisher=Cambridge University Press|isbn=052-183-940-8|edition=2nd|url=http://books.google.co.uk/books?id=5I5AYeeh0JUC&amp;amp;printsec=frontcover&amp;amp;dq=matrix+analysis&amp;amp;hl=en&amp;amp;sa=X&amp;amp;ei=bC91Ut2rCPKO7Qbh8IBI&amp;amp;redir_esc=y#v=onepage&amp;amp;q=matrix%20analysis&amp;amp;f=false}}&lt;br /&gt;
&amp;lt;/ref&amp;gt; Some particular topics out of many include; operations defined on matrices (such as [[matrix addition]], [[matrix multiplication]] and operations derived from these), functions of matrices (such as [[matrix exponentiation]] and [[matrix logarithm]], and even [[sine]]s and cosines etc. of matrices),&amp;lt;ref&amp;gt;{{cite book|title=Functions of Matrices: Theory and Computation|author=N. J. Higham|year=2000 |publisher=SIAM|isbn=089-871-777-9|url=http://books.google.co.uk/books?id=S6gpNn1JmbgC&amp;amp;printsec=frontcover&amp;amp;dq=matrix+functions&amp;amp;hl=en&amp;amp;sa=X&amp;amp;ei=_x1-UqDLE4qV7Qa5s4DAAg&amp;amp;redir_esc=y#v=onepage&amp;amp;q=matrix%20functions&amp;amp;f=false}}&lt;br /&gt;
&amp;lt;/ref&amp;gt; and the [[eigenvalue]]s of matrices ([[eigendecomposition of a matrix]], [[eigenvalue perturbation]] theory).&lt;br /&gt;
&lt;br /&gt;
==Matrix spaces==&lt;br /&gt;
&lt;br /&gt;
The set of all &amp;#039;&amp;#039;m&amp;#039;&amp;#039;×&amp;#039;&amp;#039;n&amp;#039;&amp;#039; matrices over a number [[field (mathematics)|field]] &amp;#039;&amp;#039;F&amp;#039;&amp;#039; denoted in this article &amp;#039;&amp;#039;M&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;mn&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;(&amp;#039;&amp;#039;F&amp;#039;&amp;#039;) form a [[vector space]]. Examples of &amp;#039;&amp;#039;F&amp;#039;&amp;#039; include the set of [[integer]]s ℤ, the [[real number]]s ℝ, and set of [[complex number]]s ℂ. The spaces &amp;#039;&amp;#039;M&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;mn&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;(&amp;#039;&amp;#039;F&amp;#039;&amp;#039;) and &amp;#039;&amp;#039;M&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;pq&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;(&amp;#039;&amp;#039;F&amp;#039;&amp;#039;) are different spaces if &amp;#039;&amp;#039;m&amp;#039;&amp;#039; and &amp;#039;&amp;#039;p&amp;#039;&amp;#039; are unequal, and if &amp;#039;&amp;#039;n&amp;#039;&amp;#039; and &amp;#039;&amp;#039;q&amp;#039;&amp;#039; are unequal; for instance &amp;#039;&amp;#039;M&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;32&amp;lt;/sub&amp;gt;(&amp;#039;&amp;#039;F&amp;#039;&amp;#039;) ≠ &amp;#039;&amp;#039;M&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;23&amp;lt;/sub&amp;gt;(&amp;#039;&amp;#039;F&amp;#039;&amp;#039;). Two &amp;#039;&amp;#039;m&amp;#039;&amp;#039;×&amp;#039;&amp;#039;n&amp;#039;&amp;#039; matrices &amp;#039;&amp;#039;&amp;#039;A&amp;#039;&amp;#039;&amp;#039; and &amp;#039;&amp;#039;&amp;#039;B&amp;#039;&amp;#039;&amp;#039; in &amp;#039;&amp;#039;M&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;mn&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;(&amp;#039;&amp;#039;F&amp;#039;&amp;#039;) can be added together to form another matrix in the space &amp;#039;&amp;#039;M&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;mn&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;(&amp;#039;&amp;#039;F&amp;#039;&amp;#039;):&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\mathbf{A},\mathbf{B} \in M_{mn}(F)\,,\quad \mathbf{A} + \mathbf{B} \in M_{mn}(F) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and multiplied by a &amp;#039;&amp;#039;α&amp;#039;&amp;#039; in &amp;#039;&amp;#039;F&amp;#039;&amp;#039;, to obtain another matrix in &amp;#039;&amp;#039;M&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;mn&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;(&amp;#039;&amp;#039;F&amp;#039;&amp;#039;):&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\alpha \in F \,,\quad \alpha \mathbf{A} \in M_{mn}(F) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Combining these two properties, a [[linear combination]] of matrices &amp;#039;&amp;#039;&amp;#039;A&amp;#039;&amp;#039;&amp;#039; and &amp;#039;&amp;#039;&amp;#039;B&amp;#039;&amp;#039;&amp;#039; are in &amp;#039;&amp;#039;M&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;mn&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;(&amp;#039;&amp;#039;F&amp;#039;&amp;#039;) is another matrix in &amp;#039;&amp;#039;M&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;mn&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;(&amp;#039;&amp;#039;F&amp;#039;&amp;#039;):&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\alpha \mathbf{A} + \beta\mathbf{B} \in M_{mn}(F) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;#039;&amp;#039;α&amp;#039;&amp;#039; and &amp;#039;&amp;#039;β&amp;#039;&amp;#039; are numbers in &amp;#039;&amp;#039;F&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
Any matrix can be expressed as a linear combination of basis matrices, which play the role of the [[basis vector]]s for the matrix space. For example, for the set of 2×2 matrices over the field of real numbers, &amp;#039;&amp;#039;M&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;22&amp;lt;/sub&amp;gt;(ℝ), one legitimate basis set of matrices is:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\begin{pmatrix}1&amp;amp;0\\0&amp;amp;0\end{pmatrix}\,,\quad&lt;br /&gt;
\begin{pmatrix}0&amp;amp;1\\0&amp;amp;0\end{pmatrix}\,,\quad&lt;br /&gt;
\begin{pmatrix}0&amp;amp;0\\1&amp;amp;0\end{pmatrix}\,,\quad&lt;br /&gt;
\begin{pmatrix}0&amp;amp;0\\0&amp;amp;1\end{pmatrix}\,,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
because any 2×2 matrix can be expressed as:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\begin{pmatrix}a&amp;amp;b\\c&amp;amp;d\end{pmatrix}=a \begin{pmatrix}1&amp;amp;0\\0&amp;amp;0\end{pmatrix}&lt;br /&gt;
+b\begin{pmatrix}0&amp;amp;1\\0&amp;amp;0\end{pmatrix}&lt;br /&gt;
+c\begin{pmatrix}0&amp;amp;0\\1&amp;amp;0\end{pmatrix}&lt;br /&gt;
+d\begin{pmatrix}0&amp;amp;0\\0&amp;amp;1\end{pmatrix}\,,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;#039;&amp;#039;a&amp;#039;&amp;#039;, &amp;#039;&amp;#039;b&amp;#039;&amp;#039;, &amp;#039;&amp;#039;c&amp;#039;&amp;#039;,&amp;#039;&amp;#039;d&amp;#039;&amp;#039; are all real numbers. This idea applies to other fields and matrices of higher dimensions.&lt;br /&gt;
&lt;br /&gt;
==Determinants==&lt;br /&gt;
&lt;br /&gt;
{{main|Determinant}}&lt;br /&gt;
&lt;br /&gt;
The &amp;#039;&amp;#039;&amp;#039;determinant&amp;#039;&amp;#039;&amp;#039; of a square matrix is an important property. The determinant indicates if a matrix is [[invertible]] (i.e. the [[inverse matrix|inverse of a matrix]] exists). Determinants are used for finding eigenvalues of matrices (see below), and for solving a [[system of linear equations]] (see [[Cramer&amp;#039;s rule]]).&lt;br /&gt;
&lt;br /&gt;
==Eigenvalues and eigenvectors of matrices==&lt;br /&gt;
&lt;br /&gt;
{{main|Eigenvalues and eigenvectors}}&lt;br /&gt;
&lt;br /&gt;
===Definitions===&lt;br /&gt;
&lt;br /&gt;
An &amp;#039;&amp;#039;n&amp;#039;&amp;#039;×&amp;#039;&amp;#039;n&amp;#039;&amp;#039; matrix &amp;#039;&amp;#039;&amp;#039;A&amp;#039;&amp;#039;&amp;#039; has &amp;#039;&amp;#039;&amp;#039;eigenvectors&amp;#039;&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;x&amp;#039;&amp;#039;&amp;#039; and &amp;#039;&amp;#039;&amp;#039;eigenvalues&amp;#039;&amp;#039;&amp;#039; &amp;#039;&amp;#039;λ&amp;#039;&amp;#039; defined by the relation:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\mathbf{A}\mathbf{x} = \lambda \mathbf{x}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In words, the [[matrix multiplication]] of &amp;#039;&amp;#039;&amp;#039;A&amp;#039;&amp;#039;&amp;#039; followed by an eigenvector &amp;#039;&amp;#039;&amp;#039;x&amp;#039;&amp;#039;&amp;#039; (here an &amp;#039;&amp;#039;n&amp;#039;&amp;#039;-dimensional [[column matrix]]), is the same as multiplying the eigenvector by the eigenvalue. For an &amp;#039;&amp;#039;n&amp;#039;&amp;#039;×&amp;#039;&amp;#039;n&amp;#039;&amp;#039; matrix, there are &amp;#039;&amp;#039;n&amp;#039;&amp;#039; eigenvalues. The eigenvalues are the roots of the [[characteristic polynomial]]:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;p_\mathbf{A}(\lambda) = \det(\mathbf{A} - \lambda \mathbf{I}) = 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;#039;&amp;#039;&amp;#039;I&amp;#039;&amp;#039;&amp;#039; is the &amp;#039;&amp;#039;n&amp;#039;&amp;#039;×&amp;#039;&amp;#039;n&amp;#039;&amp;#039; [[identity matrix]].&lt;br /&gt;
&lt;br /&gt;
[[Properties of polynomial roots|Roots of polynomial]]s, in this context the eigenvalues, can all be different, or some may be equal (in which case eigenvalue has [[Multiplicity (mathematics)#Multiplicity of a root of a polynomial|multiplicity]], the number of times an eigenvalue occurs). After solving for the eigenvalues, the eigenvectors corresponding to the eigenvalues can be found by the defining equation.&lt;br /&gt;
&lt;br /&gt;
===Perturbations of eigenvalues===&lt;br /&gt;
&lt;br /&gt;
{{main|Eigenvalue perturbation}}&lt;br /&gt;
&lt;br /&gt;
==Matrix similarity==&lt;br /&gt;
&lt;br /&gt;
{{main|Matrix similarity|Change of basis}}&lt;br /&gt;
&lt;br /&gt;
Two &amp;#039;&amp;#039;n&amp;#039;&amp;#039;×&amp;#039;&amp;#039;n&amp;#039;&amp;#039; matrices &amp;#039;&amp;#039;&amp;#039;A&amp;#039;&amp;#039;&amp;#039; and &amp;#039;&amp;#039;&amp;#039;B&amp;#039;&amp;#039;&amp;#039; are similar if they are related by a &amp;#039;&amp;#039;&amp;#039;similarity transformation&amp;#039;&amp;#039;&amp;#039;:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\mathbf{B} = \mathbf{P}\mathbf{A}\mathbf{P}^{-1}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The matrix &amp;#039;&amp;#039;&amp;#039;P&amp;#039;&amp;#039;&amp;#039; is called a &amp;#039;&amp;#039;&amp;#039;similarity matrix&amp;#039;&amp;#039;&amp;#039;, and is necessarily [[matrix inverse|invertible]].&lt;br /&gt;
&lt;br /&gt;
===Unitary similarity===&lt;br /&gt;
&lt;br /&gt;
{{main|Unitary matrix}}&lt;br /&gt;
&lt;br /&gt;
==Canonical forms==&lt;br /&gt;
&lt;br /&gt;
{{other uses|Canonical form}}&lt;br /&gt;
&lt;br /&gt;
===Row echelon form===&lt;br /&gt;
&lt;br /&gt;
{{main|Row echelon form}}&lt;br /&gt;
&lt;br /&gt;
===Jordan normal form===&lt;br /&gt;
&lt;br /&gt;
{{main|Jordan normal form}}&lt;br /&gt;
&lt;br /&gt;
===Weyr canonical form===&lt;br /&gt;
&lt;br /&gt;
{{main|Weyr canonical form}}&lt;br /&gt;
&lt;br /&gt;
===Frobenius normal form===&lt;br /&gt;
&lt;br /&gt;
{{main|Frobenius normal form}}&lt;br /&gt;
&lt;br /&gt;
==Triangular factorization==&lt;br /&gt;
&lt;br /&gt;
===LU decomposition===&lt;br /&gt;
&lt;br /&gt;
{{main|LU decomposition}}&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;LU decomposition&amp;#039;&amp;#039;&amp;#039; splits a matrix into a matrix product of an upper [[triangular matrix]] and a lower triangle matrix.&lt;br /&gt;
&lt;br /&gt;
==Matrix norms==&lt;br /&gt;
&lt;br /&gt;
{{Main|Matrix norm}}&lt;br /&gt;
&lt;br /&gt;
Since matrices form vector spaces, one can form axioms (analogous to those of vectors) to define a &amp;quot;size&amp;quot; of a particular matrix. The norm of a matrix is a positive real number.&lt;br /&gt;
&lt;br /&gt;
===Definition and axioms===&lt;br /&gt;
&lt;br /&gt;
For all matrices &amp;#039;&amp;#039;&amp;#039;A&amp;#039;&amp;#039;&amp;#039; and &amp;#039;&amp;#039;&amp;#039;B&amp;#039;&amp;#039;&amp;#039; in &amp;#039;&amp;#039;M&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;mn&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;(&amp;#039;&amp;#039;F&amp;#039;&amp;#039;), and all numbers &amp;#039;&amp;#039;α&amp;#039;&amp;#039; in &amp;#039;&amp;#039;F&amp;#039;&amp;#039;, a matrix norm, delimited by double vertical bars || ... ||, fulfills:&amp;lt;ref group=&amp;quot;note&amp;quot;&amp;gt;Some authors, e.g. Horn and Johnson, use triple vertical bars instead of double: |||&amp;#039;&amp;#039;&amp;#039;A&amp;#039;&amp;#039;&amp;#039;|||.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*[[Nonnegative]]: &lt;br /&gt;
::&amp;lt;math&amp;gt;\| \mathbf{A} \| \ge 0&amp;lt;/math&amp;gt;&lt;br /&gt;
:with equality only for &amp;#039;&amp;#039;&amp;#039;A&amp;#039;&amp;#039;&amp;#039; = &amp;#039;&amp;#039;&amp;#039;0&amp;#039;&amp;#039;&amp;#039;, the [[zero matrix]].&lt;br /&gt;
*[[Scalar multiplication]]:&lt;br /&gt;
::&amp;lt;math&amp;gt;\|\alpha \mathbf{A}\|=|\alpha| \|\mathbf{A}\|&amp;lt;/math&amp;gt; &lt;br /&gt;
*The [[triangular inequality]]:&lt;br /&gt;
::&amp;lt;math&amp;gt;\|\mathbf{A}+\mathbf{B}\| \leq \|\mathbf{A}\|+\|\mathbf{B}\|&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Frobenius norm===&lt;br /&gt;
&lt;br /&gt;
The &amp;#039;&amp;#039;&amp;#039;Frobenius norm&amp;#039;&amp;#039;&amp;#039; is analogous to the [[dot product]] of Euclidean vectors; multiply matrix elements entry-wise, add up the results, then take the positive square root:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\|\mathbf{A}\| = \sqrt{\mathbf{A}:\mathbf{A}} = \sqrt{\sum_{i=1}^m \sum_{j=1}^n (A_{ij})^2}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
It is defined for matrices of any dimension (i.e. no restriction to square matrices).&lt;br /&gt;
&lt;br /&gt;
==Positive definite and semidefinite matrices ==&lt;br /&gt;
&lt;br /&gt;
{{main|Positive definite matrix}}&lt;br /&gt;
&lt;br /&gt;
==Functions==&lt;br /&gt;
&lt;br /&gt;
{{main|Function (mathematics)}}&lt;br /&gt;
&lt;br /&gt;
Matrix elements are not restricted to constant numbers, they can be [[mathematical variable]]s.&lt;br /&gt;
&lt;br /&gt;
===Functions of matrices ===&lt;br /&gt;
&lt;br /&gt;
A functions of a matrix takes in a matrix, and return something else (a number, vector, matrix, etc...).&lt;br /&gt;
&lt;br /&gt;
===Matrix-valued functions ===&lt;br /&gt;
&lt;br /&gt;
A matrix valued function takes in something (a number, vector, matrix, etc...) and returns a matrix.&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!---rather than simply deleting, please include these in the article somewhere wherever relevant after the real content is written---&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Other branches of analysis===&lt;br /&gt;
&lt;br /&gt;
*[[Mathematical analysis]]&lt;br /&gt;
*[[Tensor analysis]]&lt;br /&gt;
*[[Matrix calculus]]&lt;br /&gt;
*[[Numerical analysis]]&lt;br /&gt;
&lt;br /&gt;
===Other concepts of linear algebra===&lt;br /&gt;
&lt;br /&gt;
*[[Tensor product]]&lt;br /&gt;
*[[Spectrum of an operator]]&lt;br /&gt;
*[[Matrix geometrical series]]&lt;br /&gt;
&lt;br /&gt;
===Types of matrix===&lt;br /&gt;
&lt;br /&gt;
*[[Orthogonal matrix]], [[unitary matrix]]&lt;br /&gt;
*[[Symmetric matrix]], [[antisymmetric matrix]]&lt;br /&gt;
*[[Stochastic matrix]]&lt;br /&gt;
&lt;br /&gt;
===Matrix functions===&lt;br /&gt;
&lt;br /&gt;
*[[Matrix polynomial]]&lt;br /&gt;
*[[Matrix exponential]]&lt;br /&gt;
&lt;br /&gt;
==Footnotes==&lt;br /&gt;
&lt;br /&gt;
{{Reflist|group=&amp;quot;note&amp;quot;|1}}&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
===Notes===&lt;br /&gt;
&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
===Further reading===&lt;br /&gt;
&lt;br /&gt;
*{{cite book|title=Matrix Analysis and Applied Linear Algebra Book and Solutions Manual|author=C. Meyer|year=2000 |publisher=SIAM|isbn=089-871-454-0|volume=2|series=Matrix Analysis and Applied Linear Algebra|url=http://books.google.co.uk/books?id=Zg4M0iFlbGcC&amp;amp;printsec=frontcover&amp;amp;dq=Matrix+Analysis&amp;amp;hl=en&amp;amp;sa=X&amp;amp;ei=SCd1UryWD_LG7Aag_4HwBg&amp;amp;ved=0CGoQ6AEwCQ#v=onepage&amp;amp;q=Matrix%20Analysis&amp;amp;f=false}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book|title=Applied Linear Algebra and Matrix Analysis|author=T. S. Shores|year=2007|publisher=Springer|isbn=038-733-195-6|series=Undergraduate Texts in Mathematics|url=http://books.google.co.uk/books?id=8qwTb9P-iW8C&amp;amp;printsec=frontcover&amp;amp;dq=Matrix+Analysis&amp;amp;hl=en&amp;amp;sa=X&amp;amp;ei=SCd1UryWD_LG7Aag_4HwBg&amp;amp;ved=0CGQQ6AEwCA#v=onepage&amp;amp;q=Matrix%20Analysis&amp;amp;f=false}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book|title=Matrix Analysis|author=Rajendra Bhatia|year=1997|volume=169|series=Matrix Analysis Series|publisher=Springer|isbn=038-794-846-5|url=http://books.google.co.uk/books?id=F4hRy1F1M6QC&amp;amp;printsec=frontcover&amp;amp;dq=matrix+analysis&amp;amp;hl=en&amp;amp;sa=X&amp;amp;ei=_SR1UpbnNarA7AaPjIHIDA&amp;amp;redir_esc=y#v=onepage&amp;amp;q=matrix%20analysis&amp;amp;f=false}}&lt;br /&gt;
&lt;br /&gt;
*{{cite book|title=Computational Matrix Analysis|author=Alan J. Laub|year=2012|publisher=SIAM|isbn=161-197-221-3|url=http://books.google.co.uk/books?id=RJBZBuHpVjEC&amp;amp;printsec=frontcover&amp;amp;dq=Matrix+Analysis&amp;amp;hl=en&amp;amp;sa=X&amp;amp;ei=Iyl1UtCuEIbm7Abc4YHoCg&amp;amp;ved=0CDAQ6AEwADgK#v=onepage&amp;amp;q=Matrix%20Analysis&amp;amp;f=false}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Linear algebra]]&lt;br /&gt;
[[Category:Matrices]]&lt;br /&gt;
[[Category:Numerical analysis]]&lt;/div&gt;</summary>
		<author><name>en&gt;Duoduoduo</name></author>
	</entry>
</feed>