Add to ORKGAdapting and designing mathematical software to achieve optimum performance on the CYBER 205 is discussed. Comments and observations are made in light of recent work done on modifying the ITPACK software package and on writing new software for vector supercomputers. The goal was to develop very efficient vector algorithms and software for solving large sparse linear systems using iterative methods
The interior point method (IPM) is now well established as a computationaly com-petitive scheme for ...
Abstract On modern architectures, the performance of 32-bit operations is often at least twice as fa...
This is the pre-peer reviewed version of the following article: Adaptive precision in block‐Jacobi p...
AbstractOver the past several years a number of research-oriented software packages for solving larg...
A technique for optimizing software is proposed that involves the use of a standardized set of compu...
This paper evaluates portable software packages for the iterative solution of very large sparse lin...
This conference is dedicated to providing an overview of the state of the art in the use of iterativ...
3rd International Workshop on Energy Efficient Supercomputing (E2SC '15)We formulate an implementati...
Manufacturers of computer hardware are able to continuously sustain an unprecedented pace of progres...
Solving large-scale systems of linear equations [] { } {}bxA = is one of the most expensive and cr...
AbstractWe examine the computational efficiency of linear algebra components in iterative solvers fo...
A model of a general class of asynchronous, iterative solution methods for linear systems is develop...
AbstractWe review the influence of the advent of high-performance computing on the solution of linea...
In the second edition of this classic monograph, complete with four new chapters and updated referen...
This book describes, in a basic way, the most useful and effective iterative solvers and appropriate...
The interior point method (IPM) is now well established as a computationaly com-petitive scheme for ...
Abstract On modern architectures, the performance of 32-bit operations is often at least twice as fa...
This is the pre-peer reviewed version of the following article: Adaptive precision in block‐Jacobi p...
AbstractOver the past several years a number of research-oriented software packages for solving larg...
A technique for optimizing software is proposed that involves the use of a standardized set of compu...
This paper evaluates portable software packages for the iterative solution of very large sparse lin...
This conference is dedicated to providing an overview of the state of the art in the use of iterativ...
3rd International Workshop on Energy Efficient Supercomputing (E2SC '15)We formulate an implementati...
Manufacturers of computer hardware are able to continuously sustain an unprecedented pace of progres...
Solving large-scale systems of linear equations [] { } {}bxA = is one of the most expensive and cr...
AbstractWe examine the computational efficiency of linear algebra components in iterative solvers fo...
A model of a general class of asynchronous, iterative solution methods for linear systems is develop...
AbstractWe review the influence of the advent of high-performance computing on the solution of linea...
In the second edition of this classic monograph, complete with four new chapters and updated referen...
This book describes, in a basic way, the most useful and effective iterative solvers and appropriate...
The interior point method (IPM) is now well established as a computationaly com-petitive scheme for ...
Abstract On modern architectures, the performance of 32-bit operations is often at least twice as fa...
This is the pre-peer reviewed version of the following article: Adaptive precision in block‐Jacobi p...