Transactions of the Japan Society for Industrial and Applied Mathematics
Online ISSN : 2424-0982
ISSN-L : 0917-2246
The Optimum Code Generation For The Matrix Programming Language LAMAX-S
Satoshi UchidaNaokazu YamakiShigeru HongoYutaka KarasawaYasuhiko Ikebe
Author information
JOURNAL FREE ACCESS

1995 Volume 5 Issue 1 Pages 67-85

Details
Abstract
The matrix programming language LAMAX-S has a facility for the description of matrix form such as band, symmetric, sparse, and the mathematical characteristics such as positive definite. In this paper, we propose a method for the potimum code generation for a LAMAX-S source program using matrix calculation rules based on these mathematical descriptions written in a LAMAX-S source program. The basic idea consists of 3 stages : (1)to change an initial calculation procedure written in the source program to various other calculation proceduires as much as possible as a candidate of the optimum procedure.(2)to estimate its computational quantity for all of the candidates.(3)to select a procedure which has the minimum computational quantity among the candidates. In this paper, we present the concrete method for this optimum process and explain the prototype system.
Content from these authors
© 1995 The Japan Society for Industrial and Applied Mathematics
Previous article Next article
feedback
Top