Learn More
Architectures for software use rich abstractions and idioms to describe system components, the nature of interactions among the components, and the patterns that guide the composition of components into systems. These abstractions are higher-level than the elements usually supported by programming languages and tools. They capture packaging and interaction(More)
ITPACK 2C is a collection of seven FORTRAN subroutines for solving large sparse linear systems by adaptive accelerated iterative algorithms. Basic iterative procedures, such as the Jacobi method, the Successive Overrelaxation method, the Symmetric Successive Overrelaxation method, and the RS method for the reduced system are combined , where possible, with(More)
Figure 10: Comparison of two diierent graph layouts for the same uses relation view: the rst contains cycles among layers, while the in the second cycles are reduced within the same layers. recognizers have no position on the diagram surface. Thus, display algorithms have to assign a position to each node of a graph, according to the kind of graph to be(More)
We are interested in iterative methods for solving systems of linear equations of the form Au = b, where A is a large sparse nonsingular matrix. When A is symmetric positive deenite, conjugate-gradient-type methods are often used since they are fairly well understood. On the other hand, when A is nonsymmetric, the choice of an eeective iterative method is(More)
Eigenvalue iterative methods, such as Arnoldi and Jacobi-Davidson, are typically used with restarting. This has signiicant performance shortcomings, since important components of the invariant subspace may be discarded. One way of saving more information at restart is the idea of \thick" restarting which keeps more Ritz vectors than needed. Our previously(More)
Acknowledgments I wish to thank Dr. David Young and Dr. David Kincaid for their advice, support, and encouragement. I could not have done it without their help. The Peaceman-Rachford Alternating Direction Implicit (ADI) Method is one of the iterative methods for solving linear sparse matrix systems. It is also an example of a nonstationary alternating-type(More)
The size, shape and slope of pipes are major components of the overall cost of wastewater collection systems. In the past, designers have used charts and specialized rules to determine the size, slopes and materials when designing wastewater collection networks. However, genetic algorithms (GA) provide powerful technique for automating the design and(More)