Ariel Luis Lombardi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Ariel Luis Lombardi has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Paola Pietra
Istituto di Analisi Numerica del C.N.R.
3 shared publications - Ricardo G. Duran
Univ Buenos Aires, Fac Ciencias Exactas & Nat, Dept Matemat, Ciudad Univ, RA-1428 Buenos Aires, Argentina
3 shared publications - Thomas Apel
Institute for Mathematics and Computer-Based Simulation Universität der Bundeswehr München Werner-Heisenberg-Weg 39 85577 Neubiberg Germany
3 shared publications - Gabriel Acosta
Instituto de Ciencias, Universidad Nacional de General Sarmiento, J. M. Gutierrez 1150, Los Polvorines, B1613GSX Provincia de Buenos Aires, Argentina
2 shared publications - Max Winkler
Faculty of Mathematics, TU Chemnitz, Chemnitz, Germany
2 shared publications - Blanca Ayuso de Dios
Centre de Recerca Matematica, Campus de Bellaterra, Bellaterra, 08193, Spain
1 shared publication
Latest Publications
- 24 February 2015
- Published by Springer Nature in Calcolo
- Vol. 53 (1) , 83-103
A posteriori error estimator for exponentially fitted Discontinuous Galerkin approximation of advection dominated problems
- 24 February 2015
- Published by Springer Nature in Calcolo
- Vol. 53 (1) , 83-103
A posteriori error estimator for exponentially fitted Discontinuous Galerkin approximation of advection dominated problems
- Open Access
- 4 July 2014
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 48 (4) , 1117-1145
Anisotropic mesh refinement in polyhedral domains: error estimates with data inL2(Ω)
The paper is concerned with the finite element solution of the Poisson equation with homogeneous Dirichlet boundary condition in a three-dimensional domain. Anisotropic, graded meshes from a former paper are reused for dealing with the singular behaviour of the solution in the vicinity of the non-smooth parts of the boundary. The discretization error is analyzed for the piecewise linear approximation in the H 1(Ω)- and L 2(Ω)-norms by using a new quasi-interpolation operator. This new interpolant is introduced in order to prove the estimates for L 2(Ω)-data in the differential equation which is not possible for the standard nodal interpolant. These new estimates allow for the extension of certain error estimates for optimal control problems with elliptic partial differential equations and for a simpler proof of the discrete compactness property for edge elements of any order on this kind of finite element meshes.
- 4 July 2014
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 48 (4) , 1117-1145
Open AccessAnisotropic mesh refinement in polyhedral domains: error estimates with data inL2(Ω)
The paper is concerned with the finite element solution of the Poisson equation with homogeneous Dirichlet boundary condition in a three-dimensional domain. Anisotropic, graded meshes from a former paper are reused for dealing with the singular behaviour of the solution in the vicinity of the non-smooth parts of the boundary. The discretization error is analyzed for the piecewise linear approximation in the H 1(Ω)- and L 2(Ω)-norms by using a new quasi-interpolation operator. This new interpolant is introduced in order to prove the estimates for L 2(Ω)-data in the differential equation which is not possible for the standard nodal interpolant. These new estimates allow for the extension of certain error estimates for optimal control problems with elliptic partial differential equations and for a simpler proof of the discrete compactness property for edge elements of any order on this kind of finite element meshes.
- Open Access
Interior penalty discontinuous Galerkin FEM for the $p(x)$-Laplacian
In this paper we construct an "Interior Penalty" Discontinuous Galerkin method to approximate the minimizer of a variational problem related to the $p(x)-$Laplacian. The function $p:\Omega\to [p_1,p_2]$ is log H\"{o}lder continuous and $1<p_1\leq p_2<\infty$. We prove that the minimizers of the discrete functional converge to the solution. We also make some numerical experiments in dimension one to compare this method with the Conforming Galerkin Method, in the case where $p_1$ is close to one. This example is motivated by its applications to image processing.Open AccessInterior penalty discontinuous Galerkin FEM for the $p(x)$-Laplacian
In this paper we construct an "Interior Penalty" Discontinuous Galerkin method to approximate the minimizer of a variational problem related to the $p(x)-$Laplacian. The function $p:\Omega\to [p_1,p_2]$ is log H\"{o}lder continuous and $1<p_1\leq p_2<\infty$. We prove that the minimizers of the discrete functional converge to the solution. We also make some numerical experiments in dimension one to compare this method with the Conforming Galerkin Method, in the case where $p_1$ is close to one. This example is motivated by its applications to image processing. - Open Access
Anisotropic mesh refinement in polyhedral domains: error estimates with data in L^2(Ω)
The paper is concerned with the finite element solution of the Poisson equation with homogeneous Dirichlet boundary condition in a three-dimensional domain. Anisotropic, graded meshes from a former paper are reused for dealing with the singular behaviour of the solution in the vicinity of the non-smooth parts of the boundary. The discretization error is analyzed for the piecewise linear approximation in the H^1(\Omega)- and L^2(\Omega)-norms by using a new quasi-interpolation operator. This new interpolant is introduced in order to prove the estimates for L^2(\Omega)-data in the differential equation which is not possible for the standard nodal interpolant. These new estimates allow for the extension of certain error estimates for optimal control problems with elliptic partial differential equation and for a simpler proof of the discrete compactness property for edge elements of any order on this kind of finite element meshes.
Open AccessAnisotropic mesh refinement in polyhedral domains: error estimates with data in L^2(Ω)
The paper is concerned with the finite element solution of the Poisson equation with homogeneous Dirichlet boundary condition in a three-dimensional domain. Anisotropic, graded meshes from a former paper are reused for dealing with the singular behaviour of the solution in the vicinity of the non-smooth parts of the boundary. The discretization error is analyzed for the piecewise linear approximation in the H^1(\Omega)- and L^2(\Omega)-norms by using a new quasi-interpolation operator. This new interpolant is introduced in order to prove the estimates for L^2(\Omega)-data in the differential equation which is not possible for the standard nodal interpolant. These new estimates allow for the extension of certain error estimates for optimal control problems with elliptic partial differential equation and for a simpler proof of the discrete compactness property for edge elements of any order on this kind of finite element meshes.
- Open Access
- 31 August 2012
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 47 (1) , 169-181
The discrete compactness property for anisotropic edge elements on polyhedral domains
We prove the discrete compactness property of the edge elements of any order on a class of anisotropically refined meshes on polyhedral domains. The meshes, made up of tetrahedra, have been introduced in [Th. Apel and S. Nicaise, Math. Meth. Appl. Sci. 21 (1998) 519–549]. They are appropriately graded near singular corners and edges of the polyhedron.
- 31 August 2012
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 47 (1) , 169-181
Open AccessThe discrete compactness property for anisotropic edge elements on polyhedral domains
We prove the discrete compactness property of the edge elements of any order on a class of anisotropically refined meshes on polyhedral domains. The meshes, made up of tetrahedra, have been introduced in [Th. Apel and S. Nicaise, Math. Meth. Appl. Sci. 21 (1998) 519–549]. They are appropriately graded near singular corners and edges of the polyhedron.
- 25 August 2011
- Published by Wiley in Numerical Methods for Partial Differential Equations
- Vol. 28 (6) , 1747-1777
Exponentially fitted discontinuous Galerkin schemes for singularly perturbed problems
New discontinuous Galerkin schemes in mixed form are introduced for symmetric elliptic problems of second order. They exhibit reduced connectivity with respect to the standard ones. The modifications in the choice of the approximation spaces and in the stabilization term do not spoil the error estimates. These methods are then used for designing new exponentially fitted schemes for advection dominated equations. The presented numerical tests show the good performances of the proposed schemes. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2011
- 25 August 2011
- Published by Wiley in Numerical Methods for Partial Differential Equations
- Vol. 28 (6) , 1747-1777
Exponentially fitted discontinuous Galerkin schemes for singularly perturbed problems
New discontinuous Galerkin schemes in mixed form are introduced for symmetric elliptic problems of second order. They exhibit reduced connectivity with respect to the standard ones. The modifications in the choice of the approximation spaces and in the stabilization term do not spoil the error estimates. These methods are then used for designing new exponentially fitted schemes for advection dominated equations. The presented numerical tests show the good performances of the proposed schemes. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2011
- Open Access
A Block Solver for the Exponentially Fitted IIPG-0 method
We consider an exponentially fitted discontinuous Galerkin method and propose a robust block solver for the resulting linear systems.
Open AccessA Block Solver for the Exponentially Fitted IIPG-0 method
We consider an exponentially fitted discontinuous Galerkin method and propose a robust block solver for the resulting linear systems.
- Open Access
- 21 April 2011
- Published by Oxford University Press (OUP) in IMA Journal of Numerical Analysis
- Vol. 31 (4) , 1683-1712
Interpolation error estimates for edge elements on anisotropic meshes
The classical error analysis for Nédélec edge interpolation requires the so-called regularity assumption on the elements. However, in Nicaise (2001, SIAM J. Numer. Anal., 39, 784–816) optimal error estimates were obtained for the lowest order case under the weaker hypothesis of the maximum angle condition. This assumption allows for anisotropic meshes that become useful, for example, for the approximation of solutions with edge singularities. In this paper we prove optimal error estimates for the edge interpolation of any order under the maximum angle condition. We also obtain sharp stability results for that interpolation on appropriate families of elements. mixed finite elements; edge elements; anisotropic finite elements.
- 21 April 2011
- Published by Oxford University Press (OUP) in IMA Journal of Numerical Analysis
- Vol. 31 (4) , 1683-1712
Open AccessInterpolation error estimates for edge elements on anisotropic meshes
The classical error analysis for Nédélec edge interpolation requires the so-called regularity assumption on the elements. However, in Nicaise (2001, SIAM J. Numer. Anal., 39, 784–816) optimal error estimates were obtained for the lowest order case under the weaker hypothesis of the maximum angle condition. This assumption allows for anisotropic meshes that become useful, for example, for the approximation of solutions with edge singularities. In this paper we prove optimal error estimates for the edge interpolation of any order under the maximum angle condition. We also obtain sharp stability results for that interpolation on appropriate families of elements. mixed finite elements; edge elements; anisotropic finite elements.
- Open Access
- 29 July 2010
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 80 (273) , 141-163
Error estimates for Raviart-Thomas interpolation of any order on anisotropic tetrahedra
We prove optimal order error estimates for the Raviart-Thomas interpolation of arbitrary order under the maximum angle condition for triangles and under two generalizations of this condition, namely, the so-called three-dimensional maximum angle condition and the regular vertex property, for tetrahedra. Our techniques are different from those used in previous papers on the subject, and the results obtained are more general in several aspects. First, intermediate regularity is allowed; that is, for the Raviart-Thomas interpolation of degree k ≥ 0 k\ge 0 , we prove error estimates of order j + 1 j+1 when the vector field being approximated has components in W j + 1 , p W^{j+1,p} , for triangles or tetrahedra, where 0 ≤ j ≤ k 0\le j \le k and 1 ≤ p ≤ ∞ 1\le p \le \infty . These results are new even in the two-dimensional case. Indeed, the estimate was known only in the case j = k j=k . On the other hand, in the three-dimensional case, results under the maximum angle condition were known only for k = 0 k=0 .
- 29 July 2010
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 80 (273) , 141-163
Open AccessError estimates for Raviart-Thomas interpolation of any order on anisotropic tetrahedra
We prove optimal order error estimates for the Raviart-Thomas interpolation of arbitrary order under the maximum angle condition for triangles and under two generalizations of this condition, namely, the so-called three-dimensional maximum angle condition and the regular vertex property, for tetrahedra. Our techniques are different from those used in previous papers on the subject, and the results obtained are more general in several aspects. First, intermediate regularity is allowed; that is, for the Raviart-Thomas interpolation of degree k ≥ 0 k\ge 0 , we prove error estimates of order j + 1 j+1 when the vector field being approximated has components in W j + 1 , p W^{j+1,p} , for triangles or tetrahedra, where 0 ≤ j ≤ k 0\le j \le k and 1 ≤ p ≤ ∞ 1\le p \le \infty . These results are new even in the two-dimensional case. Indeed, the estimate was known only in the case j = k j=k . On the other hand, in the three-dimensional case, results under the maximum angle condition were known only for k = 0 k=0 .
- 17 October 2005
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 29 (4) , 387-400
Weighted Poincaré and Korn inequalities for Hölder α domains
It is known that the classic Korn inequality is not valid for Hölder α domains. In this paper, we prove a family of weaker inequalities for this kind of domains, replacing the standard Lp‐norms by weighted norms where the weights are powers of the distance to the boundary.In order to obtain these results we prove first some weighted Poincaré inequalities and then, generalizing an argument of Kondratiev and Oleinik, we show that weighted Korn inequalities can be derived from them.The Poincaré type inequalities proved here improve previously known results.We show by means of examples that our results are optimal. Copyright © 2005 John Wiley & Sons, Ltd.
- 17 October 2005
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 29 (4) , 387-400
Weighted Poincaré and Korn inequalities for Hölder α domains
It is known that the classic Korn inequality is not valid for Hölder α domains. In this paper, we prove a family of weaker inequalities for this kind of domains, replacing the standard Lp‐norms by weighted norms where the weights are powers of the distance to the boundary.In order to obtain these results we prove first some weighted Poincaré inequalities and then, generalizing an argument of Kondratiev and Oleinik, we show that weighted Korn inequalities can be derived from them.The Poincaré type inequalities proved here improve previously known results.We show by means of examples that our results are optimal. Copyright © 2005 John Wiley & Sons, Ltd.