9,549 research outputs found
SPARSKIT: A basic tool kit for sparse matrix computations
Presented here are the main features of a tool package for manipulating and working with sparse matrices. One of the goals of the package is to provide basic tools to facilitate the exchange of software and data between researchers in sparse matrix computations. The starting point is the Harwell/Boeing collection of matrices for which the authors provide a number of tools. Among other things, the package provides programs for converting data structures, printing simple statistics on a matrix, plotting a matrix profile, and performing linear algebra operations with sparse matrices
Recommended from our members
Alternative methods for representing the inverse of linear programming basis matrices
Methods for representing the inverse of Linear Programming (LP) basis matrices are closely related to techniques for solving a system of sparse unsymmetric linear equations by direct methods. It is now well accepted that for these problems the static process of reordering the matrix in the lower block triangular (LBT) form constitutes the initial step. We introduce a combined static and dynamic factorisation of a basis matrix and derive its inverse which we call the partial elimination form of the inverse (PEFI). This factorization takes advantage of the LBT structure and produces a sparser representation of the inverse than the elimination form of the inverse (EFI). In this we make use of the original columns (of the constraint matrix) which are in the basis. To represent the factored inverse it is, however, necessary to introduce special data structures which are used in the forward and the backward transformations (the two major algorithmic steps) of the simplex method. These correspond to solving a system of equations and solving a system of equations with the transposed matrix respectively. In this paper we compare the nonzero build up of PEFI with that of EFI. We have also investigated alternative methods for updating the basis inverse in the PEFI representation. The results of our experimental investigation are presented in this pape
The dynamic control of robotic manipulators in space
Described briefly is the work done during the first half year of a three-year study on dynamic control of robotic manipulators in space. The research focused on issues for advanced control of space manipulators including practical issues and new applications for the Virtual Manipulator. In addition, the development of simulations and graphics software for space manipulators, begun during the first NASA proposal in the area, has continued. The fabrication of the Vehicle Emulator System (VES) is completed and control algorithms are in process of development
Non regression testing for the JOREK code
Non Regression Testing (NRT) aims to check if software modifications result
in undesired behaviour. Suppose the behaviour of the application previously
known, this kind of test makes it possible to identify an eventual regression,
a bug. Improving and tuning a parallel code can be a time-consuming and
difficult task, especially whenever people from different scientific fields
interact closely. The JOREK code aims at investing Magnetohydrodynamic (MHD)
instabilities in a Tokamak plasma. This paper describes the NRT procedure that
has been tuned for this simulation code. Automation of the NRT is one keypoint
to keeping the code healthy in a source code repository.Comment: No. RR-8134 (2012
Engineering Art Galleries
The Art Gallery Problem is one of the most well-known problems in
Computational Geometry, with a rich history in the study of algorithms,
complexity, and variants. Recently there has been a surge in experimental work
on the problem. In this survey, we describe this work, show the chronology of
developments, and compare current algorithms, including two unpublished
versions, in an exhaustive experiment. Furthermore, we show what core
algorithmic ingredients have led to recent successes
A practical guide to computer simulations
Here practical aspects of conducting research via computer simulations are
discussed. The following issues are addressed: software engineering,
object-oriented software development, programming style, macros, make files,
scripts, libraries, random numbers, testing, debugging, data plotting, curve
fitting, finite-size scaling, information retrieval, and preparing
presentations.
Because of the limited space, usually only short introductions to the
specific areas are given and references to more extensive literature are cited.
All examples of code are in C/C++.Comment: 69 pages, with permission of Wiley-VCH, see http://www.wiley-vch.de
(some screenshots with poor quality due to arXiv size restrictions) A
comprehensively extended version will appear in spring 2009 as book at
Word-Scientific, see http://www.worldscibooks.com/physics/6988.htm
- …