共查询到20条相似文献,搜索用时 15 毫秒
1.
Zhiping Li 《Numerische Mathematik》1995,71(3):317-330
Summary.
A numerical
method, with truncation methods as a special case, for computing
singular minimizers in variational problems is described. It is
proved that the method can avoid Lavrentiev phenomenon and detect
singular minimizers. The
convergence of the method is also established. Numerical results
on a 2-D problem are given.
Received September 21, 1994 相似文献
2.
Summary. In this paper, we derive a posteriori error estimates for the finite element approximation of quadratic optimal control problem
governed by linear parabolic equation. We obtain a posteriori error estimates for both the state and the control approximation.
Such estimates, which are apparently not available in the literature, are an important step towards developing reliable adaptive
finite element approximation schemes for the control problem.
Received July 7, 2000 / Revised version received January 22, 2001 / Published online January 30, 2002
RID="*"
ID="*" Supported by EPSRC research grant GR/R31980 相似文献
3.
W. Spann 《Numerische Mathematik》1994,69(1):103-116
Summary.
An abstract error estimate for the approximation of semicoercive variational
inequalities is obtained provided a certain condition holds for the exact
solution. This condition turns out to be necessary as is demonstrated
analytically and numerically. The results are applied to the finite element
approximation of Poisson's equation with Signorini boundary conditions
and to the obstacle problem for the beam with no fixed boundary conditions.
For second order variational inequalities the condition is always satisfied,
whereas for the beam problem the condition holds if the center of forces
belongs to the interior of the convex hull of the contact set. Applying the error
estimate yields optimal order of convergence in terms of the mesh size
.
The numerical convergence rates observed are in good agreement with the
predicted ones.
Received August 16, 1993 /
Revised version received March 21, 1994 相似文献
4.
Summary.
We give a relatively complete analysis for the
regularization method, which is usually used in solving
non-differentiable minimization problems. The model problem
considered in the paper is an obstacle
problem. In addition to the usual convergence result and a-priori
error estimates, we provide a-posteriori error estimates which are
highly desired
for practical implementation of the regularization method.
Received March 22, 1993 / Revised version received October
11, 1993 相似文献
5.
Summary.
An optimal control problem
for impressed cathodic systems in electrochemistry is studied.
The control in this problem is the current
density on the anode. A matching objective functional is
considered. We first demonstrate the existence and uniqueness
of solutions for the governing partial differential equation
with a nonlinear boundary condition. We then prove
the existence of an optimal solution.
Next, we derive a necessary condition of optimality
and establish an optimality system of equations.
Finally, we define a finite element algorithm and
derive optimal error estimates.
Received
March 10, 1993 / Revised version received July 4, 1994 相似文献
6.
A finite element method and variable transformations for a forward-backward heat equation 总被引:1,自引:0,他引:1
The Galerkin finite element method for the forward-backward heat equation is generalized to a wider class of equations with
the use of a result on the existence and uniqueness of a weak solution to the problems. First, the theory for the Galerkin
method is extended to forward-backward heat equations which contain additional convection and mass terms on an irregular domain.
Second, variable transformations are constructed and applied to solve a wide class of forward-backward heat equations that
leads to a substantial improvement. Third, Error estimates are presented. Finally, conducted numerical tests corroborate the
obtained results.
Received February 4, 1997 / Revised version received December 8, 1997 相似文献
7.
Ralf Kornhuber 《Numerische Mathematik》2002,91(4):699-721
Summary. We consider the fast solution of a class of large, piecewise smooth minimization problems. For lack of smoothness, usual
Newton multigrid methods cannot be applied. We propose a new approach based on a combination of convex minization with constrained Newton linearization. No regularization is involved. We show global convergence of the resulting monotone multigrid methods
and give polylogarithmic upper bounds for the asymptotic convergence rates. Efficiency is illustrated by numerical experiments.
Received March 22, 1999 / Revised version received February 24, 2001 / Published online October 17, 2001 相似文献
8.
Oliver G. Ernst 《Numerische Mathematik》1996,75(2):175-204
Summary. We introduce an algorithm for the efficient numerical solution of exterior boundary value problems for the Helmholtz equation.
The problem is reformulated as an equivalent one on a bounded domain using an exact non-local boundary condition on a circular
artificial boundary. An FFT-based fast Helmholtz solver is then derived for a finite-element discretization on an annular
domain. The exterior problem for domains of general shape are treated using an imbedding or capacitance matrix method. The
imbedding is achieved in such a way that the resulting capacitance matrix has a favorable spectral distribution leading to
mesh independent convergence rates when Krylov subspace methods are used to solve the capacitance matrix equation.
Received May 2, 1995 相似文献
9.
Non-local approximation of the Mumford-Shah functional 总被引:3,自引:0,他引:3
The Mumford-Shah functional, introduced to study image segmentation problems, is approximated in the sense of -convergence by a sequence of non-local integral functionals.
Received June 6, 1996 / Accepted July 11, 1996 相似文献
10.
Summary. In this paper, we derive quasi-norm a priori and a posteriori error estimates for the Crouzeix-Raviart type finite element
approximation of the p-Laplacian. Sharper a priori upper error bounds are obtained. For instance, for sufficiently regular
solutions we prove optimal a priori error bounds on the discretization error in an energy norm when . We also show that the new a posteriori error estimates provide improved upper and lower bounds on the discretization error.
For sufficiently regular solutions, the a posteriori error estimates are further shown to be equivalent on the discretization
error in a quasi-norm.
Received January 25, 1999 / Revised version received June 5, 2000 Published online March 20, 2001 相似文献
11.
Michel Chipot 《Numerische Mathematik》1999,83(3):325-352
Summary. The goal of the paper is to analyze the creation of microstructure in problems of Calculus of Variations with wells. More
precisely we consider a case with strong incompatibility between the wells. This forces the minimizing sequences to use other
gradients than the wells in a puzzling way. Using a method we are then able to single out discrete minimizing sequences and to give energy estimates in terms of the mesh size.
Received December 23, 1997 / Revised version received September 7, 1998 / Published online: June 29, 1999 相似文献
12.
Summary. A general method for constructing high-order approximation schemes for
Hamilton-Jacobi-Bellman equations is given. The method is based on a
discrete version of the Dynamic Programming Principle. We prove a
general convergence result for this class of approximation schemes also
obtaining, under more restrictive assumptions, an estimate in
of the order of convergence and of the local truncation error. The
schemes can be applied, in particular, to the stationary linear first
order equation in . We present several
examples of schemes
belonging to this class and with fast convergence to the solution.
Received July 4, 1992 / Revised version received July 7, 1993 相似文献
13.
In this paper, a multigrid algorithm is presented for the mortar element method for P1 nonconforming element. Based on the
theory developed by Bramble, Pasciak, Xu in [5], we prove that the W-cycle multigrid is optimal, i.e. the convergence rate
is independent of the mesh size and mesh level. Meanwhile, a variable V-cycle multigrid preconditioner is constructed, which
results in a preconditioned system with uniformly bounded condition number.
Received May 11, 1999 / Revised version received April 1, 2000 / Published online October 16, 2000 相似文献
14.
Summary. In this paper, we develop and analyze a new finite element method called the sparse finite element method for second order
elliptic problems. This method involves much fewer degrees of freedom than the standard finite element method. We show nevertheless
that such a sparse finite element method still possesses the superconvergence and other high accuracy properties same as those
of the standard finite element method. The main technique in our analysis is the use of some integral identities.
Received October 1, 1995 / Revised version received August 23, 1999 / Published online February 5, 2001 相似文献
15.
Summary. By means of identity techniques, in this paper,
we develop the stream function-vorticity-pressure method and obtain
the full approximation convergence and global superconvergence
estimates for the Stokes equations.
Received September 3, 1992 / Revised version received
February 1, 1994 相似文献
16.
A numerical method is established for computing the weakly lower semicontinuous envelope of integral functionals with non-quasiconvex integrands. The convergence of the method is proved and it is shown that the method is capable of capturing curved and non-homogeneous microstructures. Numerical examples are given to show the effectiveness of the method for capturing curved and non-homogeneous laminated microstructures. 相似文献
17.
Giancarlo Sangalli 《Numerische Mathematik》2001,89(2):379-399
Summary. We develop the a posteriori error analysis for the RFB method, applied to the linear advection-diffusion problem: the numerical
error, measured in suitable norms, is estimated in terms of the numerical residual. The robustness is investiged, in the sense
that we prove uniform equivalence between a norm of the numerical residual and a particular norm of the error.
Received January 21, 2000 / Published online March 20, 2001 相似文献
18.
Summary. An unusual stabilized finite element is presented and analyzed herein for a generalized Stokes problem with a dominating
zeroth order term. The method consists in subtracting a mesh dependent term from the formulation without compromising consistency.
The design of this mesh dependent term, as well as the stabilization parameter involved, are suggested by bubble condensation.
Stability is proven for any combination of velocity and pressure spaces, under the hypotheses of continuity for the pressure
space. Optimal order error estimates are derived for the velocity and the pressure, using the standard norms for these unknowns.
Numerical experiments confirming these theoretical results, and comparisons with previous methods are presented.
Received April 26, 2001 / Revised version received July 30, 2001 / Published online October 17, 2001
Correspondence to: Gabriel R. Barrenechea 相似文献
19.
Anisotropic mesh refinement
in stabilized Galerkin methods 总被引:8,自引:0,他引:8
Summary.
The numerical solution of a convection-diffusion-reaction model problem is
considered in two and three dimensions. A stabilized finite element method
of Galerkin/Least-square type accomodates diffusion-dominated as well as
convection- and/or reaction-dominated situations. The resolution of
boundary layers occuring in the singularly perturbed case is achieved
using anisotropic mesh refinement in boundary layer regions.
In this paper, the
standard analysis of the stabilized Galerkin method on isotropic meshes
is extended to more general meshes with boundary layer refinement.
Simplicial Lagrangian elements of arbitrary order are used.
Received
March 6, 1995 / Revised version received August 18,
1995 相似文献
20.
Summary. This analysis of convergence of a coupled FEM-IEM is based on our previous work on the FEM and the IEM for exterior Helmholtz
problems. The key idea is to represent both the exact and the numerical solution by the Dirichlet-to-Neumann operators that
they induce on the coupling hypersurface in the exterior of an obstacle. The investigation of convergence can then be related
to a spectral analysis of these DtN operators. We give a general outline of our method and then proceed to a detailed investigation
of the case that the coupling surface is a sphere. Our main goal is to explore the convergence mechanism. In this context,
we show well-posedness of both the continuous and the discrete models. We further show that the discrete inf-sup constants
have a positive lower bound that does not depend on the number of DOF of the IEM. The proofs are based on lemmas on the spectra
of the continuous and the discrete DtN operators, where the spectral characterization of the discrete DtN operator is given
as a conjecture from numerical experiments. In our convergence analysis, we show algebraic (in terms of N) convergence of arbitrary order and generalize this result to exponential convergence.
Received April 10, 1999 / Revised version received November 10, 1999 / Published online October 16, 2000 相似文献