enter search term and/or author name
High-performance bidiagonal reduction using tile algorithms on homogeneous multicore architectures
Hatem Ltaief, Piotr Luszczek, Jack Dongarra
Article No.: 16
This article presents a new high-performance bidiagonal reduction (BRD) for homogeneous multicore architectures. This article is an extension of the high-performance tridiagonal reduction implemented by the same authors [Luszczek et al., IPDPS...
An efficient overloaded method for computing derivatives of mathematical functions in MATLAB
Michael A. Patterson, Matthew Weinstein, Anil V. Rao
Article No.: 17
An object-oriented method is presented that computes without truncation the error derivatives of functions defined by MATLAB computer codes. The method implements forward-mode automatic differentiation via operator overloading in a manner that...
An algorithm for the complete solution of quadratic eigenvalue problems
Sven Hammarling, Christopher J. Munro, Françoise Tisseur
Article No.: 18
We develop a new algorithm for the computation of all the eigenvalues and optionally the right and left eigenvectors of dense quadratic matrix polynomials. It incorporates scaling of the problem parameters prior to the computation of eigenvalues,...
Efficient generalized Hessenberg form and applications
Nela Bosner, Zvonimir Bujanović, Zlatko Drmač
Article No.: 19
This article proposes an efficient algorithm for reducing matrices to generalized Hessenberg form by unitary similarity, and recommends using it as a preprocessor in a variety of applications. To illustrate its usefulness, two cases from control...
The Tapenade automatic differentiation tool: Principles, model, and specification
Laurent Hascoet, Valérie Pascual
Article No.: 20
Tapenade is an Automatic Differentiation (AD) tool which, given a Fortran or C code that computes a function, creates a new code that computes its tangent or adjoint derivatives. Tapenade puts particular emphasis on adjoint differentiation, which...
Algorithm 928: A general, parallel implementation of Dantzig--Wolfe decomposition
Article No.: 21
Dantzig--Wolfe Decomposition is recognized as a powerful, algorithmic tool for solving linear programs of block-angular form. While use of the approach has been reported in a wide variety of domains, there has not been a general implementation of...