Matrices are related to efficiency of quadratic sieve to factor RSA modulus, runtime of the algorithm can be decreased by reduction of the large sparse matrices.
利用二次筛选法分解RSA的模数时，矩阵规模对算法性能有着重要的影响，缩减矩阵的规模可以有效地缩短算法的运行时间。
Because of the density of the matrices produced by the BFGS method generally, it must adopt particular sparse technique for solving large dimensional optimization problems.
由于BFGS算法产生的矩阵一般是稠密的，因此当它用于求解大规模最优化问题时需采用一定的稀疏技巧。
Because of the density of the matrices produced by the BFGS method generally, it must adopt particular sparse technique for solving large dimensional optimization problems.
由于BFGS算法产生的矩阵一般是稠密的，因此当它用于求解大规模最优化问题时需采用一定的稀疏技巧。
应用推荐