Items 
Descriptions 
Notes 
Target Analysis Fields 
Structural Analyses and Electromagnetic, etc. 

Target Coefficient Matrix 
Sparse matrices that are generated from discretization methods
such as finite element, finite volume and differential methods. 
Calculates dense matrices; however, performs well for sparse
matrices. 
Problems with Zero Diagonal Elements 
Capable of calculating. 
Also calculates problems without diagonal dominant. 
Types of Unknowns 
Double precision real/complex number 

Symmetry of Problems 
Calculate both symmetric and asymmetric problems. 
Also calculates hermitian and skew symmetric problems. 
Calculable matrix scale 
In the case of 1GB memory usage, approximate standard size is as follows:
[2 dimension problems]
* about 1,000,000 unknowns (incore)
* about 5,000,000 unknowns (outofcore)
[3 dimension problems]
* about 200,000 unknowns (incore)
* about 800,000 unknowns (outofcore)

The limit size can vary several times depending on complexity of particular grid. 
Input Data 
Coefficient matrix and righthandside vector 

Output Data 
Solution vector 

Indication of Error Messages 
Warnings and error messages returned as return value (calculation
information, system information, etc). 

Method of Provision 
DLL format for Windows; Static library format for Linux and
UNIX. 
Source code will not be disclosed. 
Attached Materials 
Product manual (with explanations about data format, parameters,
integration procedures, etc.), sample data, sample program
for integrating SMSAMG (C and FORTRAN). 
