The ELPA library: scalable parallel eigenvalue solutions for electronic structure theory and computational science

A Marek, V Blum, R Johanni, V Havu… - Journal of Physics …, 2014 - iopscience.iop.org
Obtaining the eigenvalues and eigenvectors of large matrices is a key problem in electronic
structure theory and many other areas of computational science. The computational effort …

Proximal algorithms

N Parikh, S Boyd - Foundations and trends® in Optimization, 2014 - nowpublishers.com
This monograph is about a class of optimization algorithms called proximal algorithms. Much
like Newton's method is a standard tool for solving unconstrained smooth optimization …

[图书][B] Computational methods for fluid dynamics

JH Ferziger, M Perić, RL Street - 2019 - books.google.com
This book is a guide to numerical methods for solving fluid dynamics problems. The most
widely used discretization and solution methods, which are also found in most commercial …

[图书][B] Templates for the solution of linear systems: building blocks for iterative methods

R Barrett, M Berry, TF Chan, J Demmel, J Donato… - 1994 - SIAM
Which of the following statements is true?• Users want “black box” software that they can use
with complete confidence for general problem classes without having to understand the fine …

[图书][B] Applied numerical linear algebra

JW Demmel - 1997 - SIAM
This textbook covers both direct and iterative methods for the solution of linear systems, least
squares problems, eigenproblems, and the singular value decomposition. Earlier versions …

Developments and trends in the parallel solution of linear systems

IS Duff, HA Van Der Vorst - Parallel Computing, 1999 - Elsevier
In this review paper, we consider some important developments and trends in algorithm
design for the solution of linear systems concentrating on aspects that involve the …

[图书][B] Scientific computing: an introductory survey, revised second edition

MT Heath - 2018 - SIAM
This book presents a broad overview of numerical methods for students and professionals in
computationally oriented disciplines who need to solve mathematical problems. It differs …

Efficient algorithms for computing a strong rank-revealing QR factorization

M Gu, SC Eisenstat - SIAM Journal on Scientific Computing, 1996 - SIAM
Given an m*n matrix M with m\geqslantn, it is shown that there exists a permutation Π and an
integer k such that the QR factorization MΠ=Q\left() reveals the numerical rank of M: the k*k …

A unified semi-supervised community detection framework using latent space graph regularization

L Yang, X Cao, D Jin, X Wang… - IEEE transactions on …, 2014 - ieeexplore.ieee.org
Community structure is one of the most important properties of complex networks and is a
foundational concept in exploring and understanding networks. In real world, topology …

[图书][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 …