Algebraic Sub-Structuring for Electromagnetic Applications

Journal Article · 30 June 2006 · Lecture Notes in Computer Science

DOI:https://doi.org/10.1007/11558958_43· OSTI ID:885524

Yang, C; Gao, W G; Bai, Z J; Li, X Y.S.; Lee, L Q; Husbands, P; Ng, E G

Algebraic sub-structuring refers to the process of applying matrix reordering and partitioning algorithms to divide a large sparse matrix into smaller submatrices from which a subset of spectral components are extracted and combined to form approximate solutions to the original problem. In this paper, they show that algebraic sub-structuring can be effectively used to solve generalized eigenvalue problems arising from the finite element analysis of an accelerator structure.

• Research Organization: Stanford Linear Accelerator Center (SLAC)
• Sponsoring Organization: USDOE
• DOE Contract Number: AC02-76SF00515
• OSTI ID: 885524
• Report Number(s): SLAC-PUB-11941
• Journal Information: Lecture Notes in Computer Science, Journal Name: Lecture Notes in Computer Science Vol. 3732
• Country of Publication: United States
• Language: English

Related Subjects

43 PARTICLE ACCELERATORS
ACCELERATORS
ALGORITHMS
Accelerators
Computing
COMP
EIGENVALUES