#### Filter Results:

- Full text PDF available (23)

#### Publication Year

1998

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jeremy G. Siek, Lie-Quan Lee, Andrew Lumsdaine
- C++ in-depth series
- 2002

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

- Lie-Quan Lee, Zenghai Li, Cho Ng, Kwok Ko
- 2009

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)

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)

- Lie-Quan Lee, Lixin Ge, +5 authors Kwok Ko
- 18th International Parallel and Distributed…
- 2004

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)

- Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
- OOPSLA
- 1999

In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Standard Template Library (STL), the graph algorithms in GGCL do not depend on the particular data structures upon which they operate, meaning a single algorithm can operate on… (More)

- Lie-Quan Lee, Andrew Lumsdaine
- Java Grande
- 2002

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)

- Chao Yang, Weiguo Gao, +4 authors Esmond G. Ng
- SIAM J. Scientific Computing
- 2005

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)

- Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
- ISCOPE
- 1999

Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical framework, for reasons of performance the corresponding implementations are typically realized with programming languages devoid of language features necessary to explicitly represent… (More)

- Xiaojuan Luo, Mark S. Shephard, Lie-Quan Lee, Lixin Ge, Cho Ng
- Engineering with Computers
- 2010

Higher-order finite element method requires valid curved meshes in three-dimensional domains to achieve the solution accuracy. When applying adaptive higher-order finite elements in large-scale simulations, complexities that arise include moving the curved mesh adaptation along with the critical domains to achieve computational efficiency. This paper… (More)

- Lie-Quan Lee, Andrew Lumsdaine
- IPDPS
- 2003

This paper presents the design and implementation of the Generic Message Passing framework (GMP). The design of the GMP is guided by two goals: programmer productivity and run-time performance—particularly for parallel systems having both shared and distributed memory (e.g., clusters of SMPs). To achieve these goals simultaneously, the GMP uses a generic… (More)