Communication lower bounds and optimal algorithms for numerical linear algebra
The traditional metric for the efficiency of a numerical algorithm has been the number of
arithmetic operations it performs. Technological trends have long been reducing the time to …
arithmetic operations it performs. Technological trends have long been reducing the time to …
A survey of numerical linear algebra methods utilizing mixed-precision arithmetic
The efficient utilization of mixed-precision numerical linear algebra algorithms can offer
attractive acceleration to scientific computing applications. Especially with the hardware …
attractive acceleration to scientific computing applications. Especially with the hardware …
Lanczos-type solvers for nonsymmetric linear systems of equations
MH Gutknecht - Acta numerica, 1997 - cambridge.org
Among the iterative methods for solving large linear systems with a sparse (or, possibly,
structured) nonsymmetric matrix, those that are based on the Lanczos process feature short …
structured) nonsymmetric matrix, those that are based on the Lanczos process feature short …
[图书][B] Iterative Krylov methods for large linear systems
HA Van der Vorst - 2003 - books.google.com
Based on extensive research by Henk van der Vorst, this book presents an overview of a
number of Krylov projection methods for the solution of linear systems of equations. Van der …
number of Krylov projection methods for the solution of linear systems of equations. Van der …
Solving Lattice QCD systems of equations using mixed precision solvers on GPUs
Modern graphics hardware is designed for highly parallel numerical tasks and promises
significant cost and performance benefits for many scientific applications. One such …
significant cost and performance benefits for many scientific applications. One such …
User guide for the discrete dipole approximation code DDSCAT 7.3
BT Draine, PJ Flatau - arXiv preprint arXiv:1305.6497, 2013 - arxiv.org
DDSCAT 7.3 is an open-source Fortran-90 software package applying the discrete dipole
approximation to calculate scattering and absorption of electromagnetic waves by targets …
approximation to calculate scattering and absorption of electromagnetic waves by targets …
[图书][B] Numerical linear algebra for high-performance computers
The purpose of this book is to unify and document in one place many of the techniques and
much of the current understanding about solving systems of linear equations on vector and …
much of the current understanding about solving systems of linear equations on vector and …
Fast near field calculations in the discrete dipole approximation for regular rectilinear grids
PJ Flatau, BT Draine - Optics express, 2012 - opg.optica.org
A near-field calculation of light electric field intensity inside and in the vicinity of a scattering
particle is discussed in the discrete dipole approximation. A fast algorithm is presented for …
particle is discussed in the discrete dipole approximation. A fast algorithm is presented for …
[图书][B] Computer solution of large linear systems
G Meurant - 1999 - books.google.com
This book deals with numerical methods for solving large sparse linear systems of
equations, particularly those arising from the discretization of partial differential equations. It …
equations, particularly those arising from the discretization of partial differential equations. It …
Hiding global synchronization latency in the preconditioned conjugate gradient algorithm
P Ghysels, W Vanroose - Parallel Computing, 2014 - Elsevier
Scalability of Krylov subspace methods suffers from costly global synchronization steps that
arise in dot-products and norm calculations on parallel machines. In this work, a modified …
arise in dot-products and norm calculations on parallel machines. In this work, a modified …