Multicolor reordering of sparse matrices resulting from irregular grids
ACM Transactions on Mathematical Software (TOMS)
Best quadratic spline approximation for hierarchical visualization
VISSYM '02 Proceedings of the symposium on Data Visualisation 2002
On a Construction of a Hierarchy of Best Linear Spline Approximations Using Repeated Bisection
IEEE Transactions on Visualization and Computer Graphics
Reducing the bandwidth of sparse symmetric matrices
ACM '69 Proceedings of the 1969 24th national conference
Banded structure in binary matrices
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
| Hi-index | 0.00 |
In the analysis of a structural problem by the finite element method, a large order stiffness matrix is created which describes mathematically the inter-connectivity of the system. The structure is defined in three dimensional space by discrete points called nodes. Each node is represented by its coordinates in the space. The nodes are then connected by the various finite elements that the particular computer program may utilize. (i.e., bar members, rectangular or triangular panels, three dimensional tetrahedrons, etc.)