In mathematical models where the dimensions of the matrices are very large, the use of classical methods to compute the singular values is very time consuming and requires a lot of computational resources. In this way, it is necessary to find new faster methods to compute the singular values of a very large matrix. We present a method to estimate the singular values of a matrix based on genetic programming (GP). GP is an approach based on the evolutionary principles of the species. GP is used to make extrapolations of data out of sample data. The extrapolations of data are achieved by irregularity functions which approximate very well the trend of the sample data. GP produces from just simple's functions, operators and a fitness function, complex mathematical expressions that adjust smoothly to a group of points of the form (Xj,yj). We obtain amazing mathematical formulas that follow the behaviour of the sample data. We compare our algorithm with two techniques: the linear regression and non linear regression approaches. Our results suggest that we can predict with some percentage of error the largest singular values of a matrix without computing the singular values of the whole matrix and using only some random selected columns of the matrix.
[1]
Elizabeth R. Jessup,et al.
Matrices, Vector Spaces, and Information Retrieval
,
1999,
SIAM Rev..
[2]
Riccardo Poli,et al.
Foundations of Genetic Programming
,
1999,
Springer Berlin Heidelberg.
[3]
Amy Nicole Langville,et al.
A Survey of Eigenvector Methods for Web Information Retrieval
,
2005,
SIAM Rev..
[4]
M. Kobayashi,et al.
Estimation of singular values of very large matrices using random sampling
,
2001
.
[5]
David R. Kincaid,et al.
Análisis numérico: las matemáticas del cálculo científico
,
1994
.
[6]
Russ Bubley,et al.
Randomized algorithms
,
2018,
CSUR.
[7]
J. E. Glynn,et al.
Numerical Recipes: The Art of Scientific Computing
,
1989
.
[8]
John R. Koza,et al.
Genetic Programming II
,
1992
.
[9]
Nicholas J. Higham,et al.
Matlab guide
,
2000
.