A sparse matrix iterative method for efficiently computing multiple simultaneous solutions

Conference · Sat Dec 31 00:00:00 EST 1994

OSTI ID:223865

Boyse, W E; Seidl, A A ^[1]

---

1. Lockheed Palo Alto Research Labs., CA (United States)

The authors consider the solution of large sparse complex symmetric indefinite systems of equations where multiple solutions are required. This type of problem occurs in calculating monostatic radar cross sections in electromagnetic scattering using the finite element method. The Quasi Minimum Residual (QMR) method, ideally suited for these matrices, is generalized using the block Lanozos algorithm to solve blocks of solutions simultaneously. The algorithm is presented and a natural convergence criterion is proposed which is shown to be as effective as the usual equation residual in monitoring convergence.

• Research Organization: Front Range Scientific Computations, Inc., Boulder, CO (United States); US Department of Energy (USDOE), Washington DC (United States); National Science Foundation, Washington, DC (United States)
• OSTI ID: 223865
• Report Number(s): CONF-9404305-Vol.1; ON: DE96005735; TRN: 96:002320-0039
• Resource Relation: Conference: Colorado conference on iterative methods, Breckenridge, CO (United States), 5-9 Apr 1994; Other Information: PBD: [1994]; Related Information: Is Part Of Colorado Conference on iterative methods. Volume 1; PB: 203 p.
• Country of Publication: United States
• Language: English

Related Subjects

99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
MATRICES
ITERATIVE METHODS
SYMMETRY
FINITE ELEMENT METHOD
COMPUTER CALCULATIONS