Radu Alexandru Todor
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Radu Alexandru Todor has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
Ch. Schwab
Seminar for Applied Mathematics ETHZ
1 shared publicationChristoph Schwab
Seminar for Applied Mathematics, ETH Zurich, 8092 Zurich, Switzerland
1 shared publication- Christoph Schwab
ETH Zurich
1 shared publication - Endre Süli
Mathematical Institute, University of Oxford, Oxford, UK
1 shared publication
Latest Publications
- Open Access
- 30 July 2008
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 42 (5) , 777-819
Sparse finite element approximation of high-dimensional transport-dominated diffusion problems
We develop the analysis of stabilized sparse tensor-product finite element methods for high-dimensional, non-self-adjoint and possibly degenerate second-order partial differential equations of the form , , where is a symmetric positive semidefinite matrix, using piecewise polynomials of degree p ≥ 1. Our convergence analysis is based on new high-dimensional approximation results in sparse tensor-product spaces. We show that the error between the analytical solution u and its stabilized sparse finite element approximation u h on a partition of Ω of mesh size h = hL = 2-L satisfies the following bound in the streamline-diffusion norm , provided u belongs to the space of functions with square-integrable mixed (k+1)st derivatives: where , i=0,1, and . We show, under various mild conditions relating L to p, L to d, or p to d, that in the case of elliptic transport-dominated diffusion problems , and hence for p ≥ 1 the 'error constant' exhibits exponential decay as d → ∞; in the case of a general symmetric positive semidefinite matrix a, the error constant is shown to grow no faster than . In any case, in the absence of assumptions that relate L, p and d, the error is still bounded by , where for all L, p, d ≥ 2.
- 30 July 2008
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 42 (5) , 777-819
Open AccessSparse finite element approximation of high-dimensional transport-dominated diffusion problems
We develop the analysis of stabilized sparse tensor-product finite element methods for high-dimensional, non-self-adjoint and possibly degenerate second-order partial differential equations of the form , , where is a symmetric positive semidefinite matrix, using piecewise polynomials of degree p ≥ 1. Our convergence analysis is based on new high-dimensional approximation results in sparse tensor-product spaces. We show that the error between the analytical solution u and its stabilized sparse finite element approximation u h on a partition of Ω of mesh size h = hL = 2-L satisfies the following bound in the streamline-diffusion norm , provided u belongs to the space of functions with square-integrable mixed (k+1)st derivatives: where , i=0,1, and . We show, under various mild conditions relating L to p, L to d, or p to d, that in the case of elliptic transport-dominated diffusion problems , and hence for p ≥ 1 the 'error constant' exhibits exponential decay as d → ∞; in the case of a general symmetric positive semidefinite matrix a, the error constant is shown to grow no faster than . In any case, in the absence of assumptions that relate L, p and d, the error is still bounded by , where for all L, p, d ≥ 2.
- 16 February 2008
- Published by Oxford University Press (OUP) in IMA Journal of Numerical Analysis
- Vol. 29 (1) , 72-85
A new approach to energy-based sparse finite-element spaces
We show that the logarithmic factor in the standard error estimate for sparse finite element (FE) spaces in arbitrary dimension d is removable in the energy (H1) norm. Via a penalized sparse grid condition, we then propose and analyse a new version of the energy-based sparse FE spaces introduced first in Bungartz (1992, Dünne Gitter und deren Anwendung bei der adaptiven Lösung der dreidimensionalen Poisson-Gleichung. Dissertation. Munich, Germany: TU München) and known to satisfy an optimal approximation property in the energy norm.
- 16 February 2008
- Published by Oxford University Press (OUP) in IMA Journal of Numerical Analysis
- Vol. 29 (1) , 72-85
A new approach to energy-based sparse finite-element spaces
We show that the logarithmic factor in the standard error estimate for sparse finite element (FE) spaces in arbitrary dimension d is removable in the energy (H1) norm. Via a penalized sparse grid condition, we then propose and analyse a new version of the energy-based sparse FE spaces introduced first in Bungartz (1992, Dünne Gitter und deren Anwendung bei der adaptiven Lösung der dreidimensionalen Poisson-Gleichung. Dissertation. Munich, Germany: TU München) and known to satisfy an optimal approximation property in the energy norm.
- 1 April 2007
- Published by Oxford University Press (OUP) in IMA Journal of Numerical Analysis
- Vol. 27 (2) , 232-261
Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients
A scalar, elliptic boundary-value problem in divergence form with stochastic diffusion coefficient a(x, ω) in a bounded domain D ⊂ ℝd is reformulated as a deterministic, infinite-dimensional, parametric problem by separation of deterministic (x ∈ D) and stochastic (ω ∈ Ω) variables in a(x, ω) via Karhúnen–Loève or Legendre expansions of the diffusion coefficient. Deterministic, approximate solvers are obtained by projection of this problem into a product probability space of finite dimension M and sparse discretizations of the resulting M-dimensional parametric problem. Both Galerkin and collocation approximations are considered. Under regularity assumptions on the fluctuation of a(x, ω) in the deterministic variable x, the convergence rate of the deterministic solution algorithm is analysed in terms of the number N of deterministic problems to be solved as both the chaos dimension M and the multiresolution level of the sparse discretization resp. the polynomial degree of the chaos expansion increase simultaneously.
- 1 April 2007
- Published by Oxford University Press (OUP) in IMA Journal of Numerical Analysis
- Vol. 27 (2) , 232-261
Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients
A scalar, elliptic boundary-value problem in divergence form with stochastic diffusion coefficient a(x, ω) in a bounded domain D ⊂ ℝd is reformulated as a deterministic, infinite-dimensional, parametric problem by separation of deterministic (x ∈ D) and stochastic (ω ∈ Ω) variables in a(x, ω) via Karhúnen–Loève or Legendre expansions of the diffusion coefficient. Deterministic, approximate solvers are obtained by projection of this problem into a product probability space of finite dimension M and sparse discretizations of the resulting M-dimensional parametric problem. Both Galerkin and collocation approximations are considered. Under regularity assumptions on the fluctuation of a(x, ω) in the deterministic variable x, the convergence rate of the deterministic solution algorithm is analysed in terms of the number N of deterministic problems to be solved as both the chaos dimension M and the multiresolution level of the sparse discretization resp. the polynomial degree of the chaos expansion increase simultaneously.
- 1 August 2003
- Published by Springer Nature in Computing
- Vol. 71 (1) , 43-63
Sparse Finite Elements for Stochastic Elliptic Problems ? Higher Order Moments
- 1 August 2003
- Published by Springer Nature in Computing
- Vol. 71 (1) , 43-63
Sparse Finite Elements for Stochastic Elliptic Problems ? Higher Order Moments