Abstract
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, we show that algebraic sub-structuring can be effectively used to solve generalized eigenvalue problems arising from the finite element analysis of an accelerator structure. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Yang, C., Gao, W., Bai, Z., Li, X. S., Lee, L. Q., Husbands, P., & Ng, E. G. (2006). Algebraic sub-structuring for electromagnetic applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3732 LNCS, pp. 364–373). Springer Verlag. https://doi.org/10.1007/11558958_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
