AN EFFICIENT WAY TO DO THE ASSEMBLY OF GLOBAL STIFFNESS MATRIX
AN EFFICIENT WAY TO DO THE ASSEMBLY OF GLOBAL STIFFNESS MATRIX
(OP)
Hi all,
I develop a finite element code in java.
I looking for an efficiency algorithm to do the assembly process... i need to assemble the global matrix into sparse vector for using in minimum memory.
someone that develop a finite element code maybe encounter in a memory problem when he allocate the global stiffness matrix? if yes how can i overcome this problem?
thanks in advance:)
I develop a finite element code in java.
I looking for an efficiency algorithm to do the assembly process... i need to assemble the global matrix into sparse vector for using in minimum memory.
someone that develop a finite element code maybe encounter in a memory problem when he allocate the global stiffness matrix? if yes how can i overcome this problem?
thanks in advance:)





RE: AN EFFICIENT WAY TO DO THE ASSEMBLY OF GLOBAL STIFFNESS MATRIX
Cheers
Greg Locock
New here? Try reading these, they might help FAQ731-376: Eng-Tips.com Forum Policies http://eng-tips.com/market.cfm?
RE: AN EFFICIENT WAY TO DO THE ASSEMBLY OF GLOBAL STIFFNESS MATRIX
RE: AN EFFICIENT WAY TO DO THE ASSEMBLY OF GLOBAL STIFFNESS MATRIX
Cheers
Greg Locock
New here? Try reading these, they might help FAQ731-376: Eng-Tips.com Forum Policies http://eng-tips.com/market.cfm?
RE: AN EFFICIENT WAY TO DO THE ASSEMBLY OF GLOBAL STIFFNESS MATRIX
You'll need to define the sparsity pattern before using it. You can do that with a initial dummy "assembly" run which just builds a data structure representing where all the non-zeros are. I store this in an array of lists (variable length arrays). Each element in the array is one row, and each element in the list is the column number of a non-zero in that row. This probably wastes a lot of memory because of unused space in the lists so you can use a more efficient jagged array instead.