This article describes the subroutine library SLICOT that provides Fortran implementations of numerical algorithms for computa tions in systems and control theory Around a nucleus of basic numerical linear algebra subroutines this library builds methods for the design and analysis of linear control systems A brief history of the library is given together with a description of the current versio...

In this paper we will present a detailed study on tuning double-precision matrix-matrix multiplication (DGEMM) on the Intel Xeon E5-2680 CPU. We selected an optimal algorithm from the instruction set perspective as well software tools optimized for Intel Advance Vector Extensions (AVX). Our optimizations included the use of vector memory operations, and AVX instructions. Our proposed algorithm ...

We describe a mechanical device which can be used as an analog computer to solve the transportation problem. In practice this device is simulated by a numerical algorithm. Tests show that this algorithm is 60 times faster than a current subroutine (NAG library) for an average 1000 × 1000 problem. Its performance is even better for degenerate problems in which the weights take only a small numbe...

In this paper we present an easy estimation approach for solving non-standard GEEs based on global optimization methods. Our approach has the added advantage that it can be easily implemented using existing software, such as the subroutine nlminb in Splus, which also allows for the inclusion of constraints. To illustrate our approach, we fit a non-linear dose response model with constraints to ...

We describe a new optimization scheme for finding highquality clusterings in planar graphs that uses weighted perfect matching as a subroutine. Our method provides lower-bounds on the energy of the optimal correlation clustering that are typically fast to compute and tight in practice. We demonstrate our algorithm on the problem of image segmentation where this approach outperforms existing glo...

This paper presents the first polynomial time algorithm to compute geodesics in a CAT(0) cubical complex in general dimension. The algorithm is a simple iterative method to update breakpoints of a path joining two points using Owen and Provan’s algorithm (2011) as a subroutine. Our algorithm is applicable to any CAT(0) space in which geodesics between two close points can be computed, not limit...

The 68HC12 is the latest family of Motorola 8-bit microcontrollers. It is upward compatible from the 68HC11 (at the source code level but not the object code level) but contains many new instructions and addressing modes which considerably enhance its speed and code efficiency. This paper describes the implementation of a subroutine-threaded Forth called WHYP on the MC68HC812A4 and MC68HC912B32...

We propose a very simple preprocessing algorithm for semidefinite programming. Our algorithm inspects the constraints of the problem, deletes redundant rows and columns in the constraints, and reduces the size of the variable matrix. It often detects infeasibility. Our algorithm does not rely on any optimization solver: the only subroutine it needs is Cholesky factorization, hence it can be imp...

The TOMS paper ”A Fully Portable High Performance Minimal Storage Hybrid Format Cholesky Algorithm” by Andersen, Gunnels, Gustavson, Reid, and Waśniewski, used a level 3 Cholesky kernel subroutine instead of level 2 LAPACK routine POTF2. We discuss the merits of this approach and show that its performance over POTRF is considerably improved on a variety of common platforms when POTRF is solely ...