ScaLAPACK is an acronym for scalable linear algebra package or scalable LAPACK. It is a library of high-performance linear algebra routines for distributed memory message-passing MIMD computers and networks of workstations supporting parallel virtual machine (PVM) and/or message passing interface (MPI). It is a continuation of the LAPACK project, which designed and produced analogous software for workstations, vector supercomputers, and shared memory parallel computers. Both libraries contain routines for solving systems of linear equations, least squares problems, and eigenvalue problems. The goals of both projects are efficiency, scalability, reliability, portability, flexibility, and ease of use.\parScaLAPACK includes routines for the solution of dense, band, and tridiagonal linear systems of equations, condition estimation and iterative refinement, for LU and Cholesky factorization, matrix inversion, full-rank linear least squares problems, orthogonal and generalized orthogonal factorizations, orthogonal transformation routines, reductions to upper Hessenberg, bidiagonal and tridiagonal form, reduction of a symmetric-definite/Hermitian-definite generalized eigenproblem to standard form, the symmetric/Hermitian, generalized symmetric/Hermitian, and the nonsymmetric eigenproblem. Prototype codes are provided for out-of-core solvers for LU, Cholesky, and QR, the matrix sign function for eigenproblems, and an HPF interface to a subset of ScaLAPACK routines.\parSoftware is available in single precision real, double precision real, single precision complex, and double precision complex. The software has been written to be portable across a wide range of distributed-memory environments such as the Cray T3, IBM SP, Intel series, TM CM-5, clusters of workstations, and any system for which PVM or MPI is available.\parEach Users’ Guide includes a CD-ROM containing the HTML version of the ScaLAPACK Users’ Guide, the source code for the package, testing and timing programs, prebuilt version of the library for a number of computers, example programs, and the full set of LAPACK Working Notes.

References in zbMATH (referenced in 362 articles , 3 standard articles )

Showing results 1 to 20 of 362.
Sorted by year (citations)

1 2 3 ... 17 18 19 next

  1. Barber, Xavier; Conesa, David; López-Quílez, Antonio; Mayoral, Asunción; Morales, Javier; Barber, Antoni: Bayesian hierarchical models for analysing the spatial distribution of bioclimatic indices (2017)
  2. Carlberg, Kevin; Barone, Matthew; Antil, Harbir: Galerkin v. least-squares Petrov-Galerkin projection in nonlinear model reduction (2017)
  3. Damle, Anil; Lin, Lin; Ying, Lexing: Computing localized representations of the Kohn-Sham subspace via randomization and refinement (2017)
  4. Filippone, Salvatore; Cardellini, Valeria; Barbieri, Davide; Fanfarillo, Alessandro: Sparse matrix-vector multiplication on GPGPUs (2017)
  5. Gentle, James E.: Matrix algebra. Theory, computations and applications in statistics (2017)
  6. Grigori, Laura: Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra (2017)
  7. Hadjiantoni, Stella; Kontoghiorghes, Erricos John: Estimating large-scale general linear and seemingly unrelated regressions models after deleting observations (2017)
  8. Liska, Sebastian; Colonius, Tim: A fast immersed boundary method for external incompressible viscous flows using lattice Green’s functions (2017)
  9. Marx, Alain; Lütjens, Hinrich: Hybrid parallelization of the XTOR-2F code for the simulation of two-fluid MHD instabilities in tokamaks (2017)
  10. Stoykov, S.; Margenov, S.: Numerical methods and parallel algorithms for computation of periodic responses of plates (2017)
  11. Takahiro Misawa, Satoshi Morita, Kazuyoshi Yoshimi, Mitsuaki Kawamura, Yuichi Motoyama, Kota Ido, Takahiro Ohgoe, Masatoshi Imada, Takeo Kato: mVMC - Open-source software for many-variable variational Monte Carlo method (2017) arXiv
  12. Torun, F.Sukru; Manguoglu, Murat; Aykanat, Cevdet: Parallel minimum norm solution of sparse block diagonal column overlapped underdetermined systems (2017)
  13. Wang, D.S.; Hill, Charles D.; Hollenberg, L.C.L.: Simulations of Shor’s algorithm using matrix product states (2017)
  14. Xin, Zixing; Xia, Jianlin; de Hoop, Maarten V.; Cauley, Stephen; Balakrishnan, Venkataramanan: A distributed-memory randomized structured multifrontal method for sparse direct solutions (2017)
  15. Aupy, Guillaume; Shantharam, Manu; Benoit, Anne; Robert, Yves; Raghavan, Padma: Co-scheduling algorithms for high-throughput workload execution (2016)
  16. Beliakov, Gleb; Matiyasevich, Yuri: A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic (2016)
  17. Drmač, Zlatko; Gugercin, Serkan: A new selection operator for the discrete empirical interpolation method -- improved a priori error bound and extensions (2016)
  18. Houska, Boris; Frasch, Janick; Diehl, Moritz: An augmented Lagrangian based algorithm for distributed nonconvex optimization (2016)
  19. Lācis, Uǧis; Taira, Kunihiko; Bagheri, Shervin: A stable fluid-structure-interaction solver for low-density rigid bodies using the immersed boundary projection method (2016)
  20. Liu, Xiao; Xia, Jianlin; de Hoop, Maarten V.: Parallel randomized and matrix-free direct solvers for large structured dense linear systems (2016)

1 2 3 ... 17 18 19 next