Discontinuous enrichment in finite elements with a partition of unity method

Authors:
John Dolbow;Nicolas Moës;Ted Belytschko
Affiliations:
-;-;-
Venue:
Finite Elements in Analysis and Design - Special issue on Robert J. Melosh medal competition
Year:
2000

Citing 0
Cited 13

An Eulerian method for computation of multimaterial impact with ENO shock-capturing and sharp interfaces

Journal of Computational Physics
A particle-level set-based sharp interface cartesian grid method for impact, penetration, and void collapse

Journal of Computational Physics
Performance assessment of generalized elements in the finite cover method

Finite Elements in Analysis and Design
Numerical implementation of the eXtended Finite Element Method for dynamic crack analysis

Advances in Engineering Software
Review: A survey of the extended finite element

Computers and Structures
Mesh cutting during real-time physical simulation

2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Performance assessment of generalized elements in the finite cover method

Finite Elements in Analysis and Design
Modelling well leakage in multilayer aquifer systems using the extended finite element method

Finite Elements in Analysis and Design
Diffusional evolution of precipitates in elastic media using the extended finite element and the level set methods

Journal of Computational Physics
Mesh cutting during real-time physical simulation

Computer-Aided Design
Some numerical issues on the use of XFEM for ductile fracture

Computational Mechanics
Coupling flat-top partition of unity method and finite element method

Finite Elements in Analysis and Design
Sensitivity analysis based crack propagation criterion for compressible and (near) incompressible hyperelastic materials

Finite Elements in Analysis and Design

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present an approximate analytical method to evaluate efficiently and accurately the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairly general and allows each source-destination pair to service calls of different classes, with each call occupying one wavelength per link. Our approximate analytical approach involves two steps. The arrival process of calls on some routes is first modified slightly to obtain an approximate multiclass network model. Next, all classes of calls on a particular route are aggregated to give an equivalent single-class model. Thus, path decomposition algorithms for single-class wavelength routing networks may be readilt extended to the multiclass case. This article is a first step towards understanding the issues arising in wavelength routing networks that serve multiple classes of customers.