Free Access
Volume 572, December 2014
Article Number A39
Number of page(s) 18
Section Numerical methods and codes
Published online 26 November 2014
  1. Armitage, C., & Wandelt, B. D. 2004, Phys. Rev. D, 70, 123007 [NASA ADS] [CrossRef] [Google Scholar]
  2. Bjorck, A. 1996, Numerical Methods for Least Squares Problems, Handbook of Numerical Analysis (Society for Industrial and Applied Mathematics) [Google Scholar]
  3. Borrill, J. 1999 [arXiv:astro-ph/9911389] [Google Scholar]
  4. Cantalupo, C. M., Borrill, J. D., Jaffe, A. H., Kisner, T. S., & Stompor, R. 2010, ApJSS, 187, 212 [NASA ADS] [CrossRef] [Google Scholar]
  5. Cargemel, P., Grigori, L., & Stompor, R. 2013, Parallel Computing, submitted [Google Scholar]
  6. Challinor, A., & Lewis, A. 2011, Phys. Rev. D, 84, 043516 [NASA ADS] [CrossRef] [Google Scholar]
  7. Chapman, A., & Saad, Y. 1996, Numer. Linear Algebra Appl., 4, 43 [CrossRef] [Google Scholar]
  8. de Bernardis, P., Ade, P. A. R., Bock, J. J., et al. 2000, Nature, 404, 955 [NASA ADS] [CrossRef] [PubMed] [Google Scholar]
  9. de Gasperis, G., Balbi, A., Cabella, P., Natoli, P., & Vittorio, N. 2005, A&A, 436, 1159 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
  10. De Gersem, H., & Hameyer, K. 2001, Eur. Phys. J. Appl. Phys., 13, 45 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
  11. Doré, O., Teyssier, R., Bouchet, F. R., Vibert, D., & Prunet, S. 2001, A&A, 374, 358 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
  12. Erhel, J., & Guyomarc’h, F. 1997, An Augmented Subspace Conjugate Gradient, Rapport de recherche RR-3278, INRIA [Google Scholar]
  13. Erhel, J., & Guyomarc’h, F. 2000, SIAM J. Matrix Anal. Appl., 21, 1279 [CrossRef] [Google Scholar]
  14. Golub, G., & Van Loan, C. 1996, in Matrix computations (Johns Hopkins Univ. Pr.), 3 [Google Scholar]
  15. Górski, K. M., Hivon, E., Banday, A. J., et al. 2005, ApJ, 622, 759 [NASA ADS] [CrossRef] [Google Scholar]
  16. Gosselet, P., & Rey, C. 2003, in Domain decomposition methods in science and engineering, Natl. Auton. Univ. Mex., México, 419 [Google Scholar]
  17. Grigori, L., Stompor, R., & Szydlarski, M. 2012, in Proc. Int. Conf. High Performance Computing, Networking, Storage and Analysis, SC ’12 (Los Alamitos, CA, USA: IEEE Computer Society Press), 91 [Google Scholar]
  18. Gutknecht, M. 2012, Electron.Trans. Numer. Anal., 39, 156 [Google Scholar]
  19. Hanany, S., Ade, P., Balbi, A., et al. 2000, ApJ, 545, L5 [NASA ADS] [CrossRef] [Google Scholar]
  20. Harrison, D. L., van Leeuwen, F., & Ashdown, M. A. J. 2011, A&A, 532, A55 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
  21. Havé, P., Masson, R., Nataf, F., et al. 2013, SIAM J. Sci. Comput., 35, C284 [CrossRef] [Google Scholar]
  22. Hestenes, M. R., & Stiefel, E. 1952, J. Res. National Bureau of Standards, 49, 409 [CrossRef] [MathSciNet] [Google Scholar]
  23. Keihänen, E., & Reinecke, M. 2012, A&A, 548, A110 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
  24. Kharchenko, S. A., & Yeremin, A. Y. 1995, Numer. Linear Algebra Appl., 2, 51 [CrossRef] [Google Scholar]
  25. Morgan, R. 1995, SIAM J. Matrix Analysis and Applications, 16, 1154 [CrossRef] [Google Scholar]
  26. Næss, S., & Louis, T. 2013, JCAP, in press [arXiv:1309.7473] [Google Scholar]
  27. Nicolaides, R. A. 1987, SIAM J. Num. Analysis, 24, 355 [NASA ADS] [CrossRef] [MathSciNet] [Google Scholar]
  28. Oh, S. P., Spergel, D. N., & Hinshaw, G. 1999, ApJ, 510, 551 [NASA ADS] [CrossRef] [Google Scholar]
  29. Parks, M. L., de Sturler, E., Mackey, G., Johnson, D. D., & Maiti, S. 2006, SIAM J. Sci. Comput., 28, 1651 [CrossRef] [Google Scholar]
  30. Patanchon, G., Ade, P. A. R., Bock, J. J., et al. 2008, ApJ, 681, 708 [NASA ADS] [CrossRef] [Google Scholar]
  31. Planck Collaboration VIII. 2014, A&A, 571, A8 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
  32. Risler, F., & Rey, C. 2000, Numer. Algorithms, 23, 1 [NASA ADS] [CrossRef] [Google Scholar]
  33. Saad, Y. 2003, Iterative Methods for Sparse Linear Systems: Second Edition (Society for Industrial and Applied Mathematics) [Google Scholar]
  34. Saad, Y., & Schultz, M. H. 1986, SIAM J. Sci. Stat. Comput., 7 [Google Scholar]
  35. Saad, Y., Yeung, M., Erhel, J., & Guyomarc’h, F., 2000, SIAM J. Sci. Comput., 21, 1909, Iterative methods for solving systems of algebraic equations (Copper Mountain, CO, 1998) [CrossRef] [Google Scholar]
  36. Stompor, R., Balbi, A., Borrill, J. D., et al. 2002, Phys. Rev. D, 65, 022003 [NASA ADS] [CrossRef] [Google Scholar]
  37. Stompor, R., & White, M. 2004, A&A, 419, 783 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
  38. Sudarsan, R., Borrill, J., Cantalupo, C., et al. 2011, in Proc. Int. Conf. Supercomputing, ICS ’11 (New York, NY, USA: ACM), 305 [Google Scholar]
  39. Sutton, D., Johnson, B. R., Brown, M. L., et al. 2009, MNRAS, 393, 894 [NASA ADS] [CrossRef] [Google Scholar]
  40. Tang, J. M., Nabben, R., Vuik, C., & Erlangga, Y. A. 2009, J. Sci. Comput., 39, 340 [CrossRef] [Google Scholar]
  41. Tegmark, M. 1997a, Phys. Rev. D, 56, 4514 [NASA ADS] [CrossRef] [Google Scholar]
  42. Tegmark, M. 1997b, ApJ, 480, L87 [NASA ADS] [CrossRef] [Google Scholar]
  43. van der Sluis, A., & van der Vorst, H. A. 1986, Numerische Mathematik, 48, 543 [CrossRef] [Google Scholar]
  44. Vuik, C., Nabben, R., & Tang, J. 2006, in Proc. 8th European Multigrid Conf. September 27−30, 2005 Scheveningen The Hague, The Netherlands, eds. P. Wesseling, C. Oosterlee, & P. Hemker (Delft: TU Delft) [Google Scholar]
  45. Wandelt, B. D., & Hansen, F. K. 2003, Phys. Rev. D, 67, 023001 [NASA ADS] [CrossRef] [Google Scholar]
  46. Wright, E. L., Hinshaw, G., & Bennett, C. L. 1996, The ApJ, 458, L53 [NASA ADS] [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.