282 search results - page 17 / 57 » Additive Preconditioning for Matrix Computations |
SIAMJO
2010
14 years 7 months ago
2010
When liquidating a portfolio of large blocks of risky assets, an institutional investor wants to minimize the cost as well as the risk of execution. An optimal execution strategy ...
135
click to vote
TCS
2011
14 years 7 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
100
click to vote
CORR
2010
Springer
15 years 17 days ago
2010
Springer
Abstract. CG, SYMMLQ, and MINRES are Krylov subspace methods for solving large symmetric systems of linear equations. CG (the conjugate-gradient method) is reliable on positive-def...
110
Voted
SIAMMAX
2010
14 years 7 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
134
click to vote
HASE
2008
IEEE
15 years 7 months ago
2008
IEEE
Due to the large number of attacks on open networks, information theft becomes a more and more severe problem. Secure computation can offer highly assured confidentiality protecti...