cblas_daxpy(dim_2, 4.0, &v1[i], dim_1, &v2[i], dim_1); } If I diagonalize a matrix with dimension 3000 using a Lapack program, it should be finished within 10 seconds. We know the complexity of diagonalization is O(N^3), so for a 3000*3000 matrix, the time cost should b...
cblas_daxpy(dim_2, 4.0, &v1[i], dim_1, &v2[i], dim_1); } If I diagonalize a matrix with dimension 3000 using a Lapack program, it should be finished within 10 seconds. We know the complexity of diagonalization is O(N^3), so for a 3000*3000 matrix, the tim...
cblas_daxpy(dim_2, 4.0, &v1[i], dim_1, &v2[i], dim_1); } If I diagonalize a matrix with dimension 3000 using a Lapack program, it should be finished within 10 seconds. We know the complexity of diagonalization is O(N^3), so for a 3000*3000 matrix, the time cost sho...
cblas_daxpy(dim_2, 4.0, &v1[i], dim_1, &v2[i], dim_1); } If I diagonalize a matrix with dimension 3000 using a Lapack program, it should be finished within 10 seconds. We know the complexity of diagonalization is O(N^3), so for a 3000*3000 matrix, the time cost sho...
cblas_daxpy(dim_2, 4.0, &v1[i], dim_1, &v2[i], dim_1); } If I diagonalize a matrix with dimension 3000 using a Lapack program, it should be finished within 10 seconds. We know the complexity of diagonalization is O(N^3), so for a 3000*3000 matrix, the time cost...