http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
Iterative solutions to large sparse finite element equations
355 workstation was the limiting factor for the size of the
accurate mesh based on adaptive mesh refinement iterative
adaptive mesh refinement on certain regions of a coarse mesh,
compact row storage has solved a three-dimensional finite
convergence rate and solution time are also analyzed. The
convergence rate relationship and storage requirements for
convergence rate, and the solution time for the direct and
diagonal preconditioned conjugate gradient method with the
diagonal scaling, incomplete Cholesky decomposition and SSOR
different material properties and external loading on the
dimensional linear elasticity finite element equations. The
element problem up to a maximum of 50,000 equations on an IBM
element, and compact row storage, are described along with
elements. A procedure to directly assemble the global
intermediate unconverged coarse mesh solution will closely
Iterative methods are widely used to solve sparse linear
match the modeling error from the converged solution. This
matrix storage techniques, such as profile, element-by-
PCG methods using various storage formats. Effects of
performed to compare the storage requirements, the
physical memory of 64 MB of RAM of the IBM RISC/6000 Model
preconditioners is explained in detail in this study. Sparse
problem which can be solved on a given computer compared to
reducing the solution time and increasing the size of the
result may lead to quicker solution times for a highly
RISC/6000 Model 355 workstation with 64 MB of RAM. To apply
sparse linear system that could be solved in this study. The
stiffness in compact row storage format from element
stiffness matrices is introduced. Numerical studies have been
systems due to the improvements which can be achieved in
test problems for this study are based on the three-
the modeling error over a coarse mesh must be estimated.
the preconditioned conjugate gradient methods using the
the redefined matrix operations for each storage technique
This thesis will show that the modeling error from an
traditional direct solvers. The theory behind the
which must be used to eliminate the operations on zero
Issued also on microfiche from Lange Micrographics.