JC 2007 - PDF Preprint Papers

JC 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JC-2007 Paper

click to vote

JC
2007

160views more JC 2007»

BDDC methods for discontinuous Galerkin discretization of elliptic problems

13 years 4 months ago

Download users.wpi.edu

A discontinuous Galerkin (DG) discretization of Dirichlet problem for second-order elliptic equations with discontinuous coeﬃcients in 2-D is considered. For this discretization...

Maksymilian Dryja, Juan Galvis, Marcus Sarkis

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	160	BDDC methods for discontinuous Galerkin discretization of elliptic problems	claim
2	130	On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety	claim
3	119	Factoring bivariate sparse (lacunary) polynomials	claim
4	119	Deterministic constructions of compressed sensing matrices	claim
5	109	Cubature formulas for function spaces with moderate smoothness	claim
6	101	Simple Monte Carlo and the Metropolis algorithm	claim
7	96	Error linear complexity measures for multisequences	claim
8	94	On the complexity of the multivariate Sturm-Liouville eigenvalue problem	claim
9	70	Counting solutions to binomial complete intersections	claim
10	65	Searching for extensible Korobov rules	claim
11	64	Quadrature in Besov spaces on the Euclidean sphere	claim
12	63	Optimal approximation of elliptic problems by linear and nonlinear mappings III: Frames	claim
13	62	On regularization algorithms in learning theory	claim
14	62	Error propagation of general linear methods for ordinary differential equations	claim
15	62	Lifting and recombination techniques for absolute factorization	claim
16	57	Discrepancy with respect to convex polygons	claim
17	54	A survey of randomized algorithms for control synthesis and performance verification	claim
18	49	On the complexity of Putinar's Positivstellensatz	claim
19	45	A primal-dual symmetric relaxation for homogeneous conic systems	claim
20	41	Pseudorandom numbers and entropy conditions	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers