Learn More
FileDep FileDep: a graphNEL object representing a file dependency dataset example in boost graph library Description FileDep: a graphNEL object representing a file dependency dataset example in boost graph library Usage #data(FileDep) References Boost Graph Library (Examples # this is how the graph of data(FileDep) was obtained library(graph) fd
—Omega3P is a parallel eigenmode calculation code for accelerator cavities in frequency domain analysis using finite-element methods. In this report, we will present detailed finite-element formulations and resulting eigenvalue problems for lossless cavities, cavities with lossy materials, cavities with imperfectly conducting surfaces, and cavities with(More)
The measured physical parameters of a superconducting cavity differ from those of the designed ideal cavity. This is due to shape deviations caused by both loose machine tolerances during fabrication and by the tuning process for the accelerating mode. We present a shape determination algorithm to solve for the unknown deviations from the ideal cavity using(More)
Summary form only given. We present a case study of solving very large sparse linear systems in end-to-end accelerator structure simulations. Both direct solvers and iterative solvers are investigated. A parallel multilevel preconditioner based on hierarchical finite element basis functions is considered and has been implemented to accelerate the(More)
A nonlinear Rayleigh-Ritz iterative (NRRIT) method for solving nonlinear eigenvalue problems is studied in this paper. It is an extension of the nonlinear Arnoldi algorithm due to Heinrich Voss. The effienicy of the NRRIT method is demonstrated by comparing with inverse iteration methods to solve a highly nonlinear eigenvalue problem arising from finite(More)
This paper is concerned with solving large-scale eigenvalue problems by algebraic substructuring. Algebraic substructuring 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(More)
We present case studies that apply generic programming to the development of high-performance parallel code for solving two archetypal PDEs. We examine the overall structure of the example scientific codes and consider their generic implementation. With a generic approach it is a straight-forward matter to reuse software components from different sources;(More)
We present a generic programming methodology for expressing data structures and algorithms for high-performance numerical linear algebra. As with the Standard Template Library 14, our approach explicitly separates algorithms from data structures, allowing a single set of numerical routines to operate with a wide variety of matrix types, including sparse,(More)