Passion is like genius; a miracle.

http://www.ats.ucla.edu/stat/r/library/advanced_function_r.htm *apply, sweep, and column/row functions.

http://en.wikipedia.org/wiki/Tikhonov_regularization Called ridge regression in statistics. Regularization: Ridge Regression and the LASSO is another good reference. In R, use lm.ridge(). Here’s sample code that describes not just lm.ridge, but also pls(partial least square), lasso, and pcr(principal component regression).

Leaps package has regsubsets function that automatically finds best model for each model size. Here’s example from ?regsubsets. Let’s find the best model using Adjusted R square. Build a model using them. When doing model selection, instead of using automatic methods recklessly, one should consider if the model really makes sense based on the prior…

http://en.m.wikipedia.org/wiki/Cholesky_decomposition In linear algebra, the Cholesky decomposition or Cholesky triangle is a decomposition of a Hermitian, positive-definitematrix into the product of a lower triangular matrix and itsconjugate transpose. It was discovered by André-Louis Choleskyfor real matrices. When it is applicable, the Cholesky decomposition is roughly twice as efficient as the LU decomposition for solving systems of linear equations.[1] In a loose, metaphorical sense, this can be thought of as the matrix analogue…

When we want to find of and if there is no exact answer X, then the least square approximation of is the projection of onto in column vector space . That’s because, if column vectors in are linearly independent, consists of a vector space. If there is no exact answer , then . Thus, exists…

http://en.wikipedia.org/wiki/Change_of_basis#Change_of_basis_for_vectors In linear algebra, change of basis refers to the conversion of vectors and linear transformations between matrix representations which have different bases.