DocumentCode
1933367
Title
Abstract data type and mathematical software reusability: two linked concepts
Author
Di Felice, Paolino
Author_Institution
Dept. of Electr. Eng., L´´Aquila Univ., Italy
fYear
1990
fDate
21-23 Mar 1990
Firstpage
448
Lastpage
452
Abstract
Experience with the design and implementation of a reusable Pascal code is reported. The project concerns the solution of the LU-factorization problem on large sparse matrices. The code carried out is structured into reusable units. The unit design strategy is based on the abstract data type (ADT) notion. As an example the interface of the FindPivot unit, of the LU factorisation program, is listed
Keywords
Pascal listings; data structures; mathematics computing; matrix algebra; software reusability; subroutines; LU-factorization; abstract data type; large sparse matrices; mathematical software reusability; reusable Pascal code; reusable units; unit design strategy; Laboratories; Linear algebra; Productivity; Programming profession; Research and development; Software quality; Software reusability; Software systems; Sparse matrices; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computers and Communications, 1990. Conference Proceedings., Ninth Annual International Phoenix Conference on
Conference_Location
Scottsdale, AZ
Print_ISBN
0-8186-2030-7
Type
conf
DOI
10.1109/PCCC.1990.101655
Filename
101655
Link To Document