A New Algorithm for a Posteriori Error Estimation for Approximate Solutions of Linear Ill-Posed Problems

Computational Mathematics and Mathematical Physics - A new algorithm for a posteriori estimation of the error in solutions to linear operator equations of the first kind in a Hilbert space is...     

Minimization of Linear Functionals Defined on Solutions of Large-Scale Discrete Ill-Posed Problems

The minimization of linear functionals defined on the solutions of discrete ill-posed problems arises, e.g., in the computation of confidence intervals for these solutions. In 1990, Eldén proposed an algorithm for this minimization problem based on a parametric programming reformulation involving the solution of a sequence of trust-region problems, and using matrix factorizations. In this paper, we describe MLFIP, a large-scale version of this algorithm where a limited-memory trust-region solver is used on the subproblems. We illustrate the use of our algorithm in connection with an inverse heat conduction problem. AMS subject classification (2000) 65F22     

一类优化控制问题的有限元解的误差估计和超收敛

对积分微分方程的优化控制问题进行了介绍.讨论了积分微分方程的优化控制问题的混合有限元逼近,给出了优化控制问题的有限元逼近解的误差估计和超收敛性质.     

The Optimal Approximations for Solving Linear Ill-Posed Problems

New projection discrete schemes for ill-posed problems are constructed. We show that for equations with self-adjoint operators the use of self-adjoint projection schemes is not optimal in the sense of the amount of discrete information.     

Global and Local Search Algorithms for Concave Cost Transshipment Problems

Traditionally, the minimum cost transshipment problems have been simplified as linear cost problems, which are not practical in real applications. Recently, some advanced local search algorithms have been developed that can directly solve concave cost bipartite network problems. However, they are not applicable to general transshipment problems. Moreover, the effectiveness of these modified local search algorithms for solving general concave cost transshipment problems is doubtful. In this research, we propose a global search algorithm for solving concave cost transshipment problems. Effecient methods for encoding, generating initial populations, selection, crossover and mutation are proposed, according to the problem characteristics. To evaluate the effectiveness of the proposed global search algorithm, four advanced local search algorithms based on the threshold accepting algorithm, the great deluge algorithm, and the tabu search algorithm, are also developed and are used for comparison purpose. To assist with the comparison of the proposed algorithms, a randomized network generator is designed to produce test problems. All the tests are performed on a personal computer. The results indicate that the proposed global search algorithm is more effective than the four advanced local algorithms, for solving concave cost transshipment problems.     

Conditional Stability Estimates for Ill-Posed PDE Problems by Using Interpolation

The focus of this article is on conditional stability estimates for ill-posed inverse problems in partial differential equations. Conditional stability estimates have been obtained in related literature by a couple different methods. In this article, we propose a method called interpolation method, which is based on interpolation in variable Hilbert scales. We provide the theoretical background of this method and show that optimal conditional stability estimates are obtained. The capabilities of our method are illustrated by a comprehensive collection of different inverse and ill-posed PDE problems containing elliptic and parabolic problems, one source problem and the problem of analytic continuation.     

Strong Stability and Non-smooth Data Error Estimates for Discretizations of Linear Parabolic Problems

We study smoothing properties of discretizations of a linear parabolic initial boundary value problem with a possibly non-selfadjoint elliptic operator. The solution at time t > 0 of this problem, as well as its time derivatives, are in L _r for initial values in L _s even when r > s. We show that similar strong stability results hold for discrete solutions obtained by discretizing in space by linear finite elements and in time by a class of A()-stable implicit rational multistep methods (including single step methods as a special case) with good smoothing properties, as well as for certain combinations of single step methods. Most of our results are derived from the corresponding L ₂-bounds, shown by semigroup techniques, together with a discrete Gagliardo-Nirenberg inequality, and generalize previously known estimates with respect to admissible problems and time discretization methods. Our techniques make it possible to obtain, e.g., supremum norm error estimates for initial data which are only required to be in L ₁.     

and Norms Error Estimates in Finite Element Method for Linear Parabolic Interface Problems

We derive new a priori error estimates for linear parabolic equations with discontinuous coefficients. Due to low global regularity of the solutions the error analysis of the standard finite element method for parabolic problems is difficult to adopt for parabolic interface problems. A finite element procedure is, therefore, proposed and analyzed in this paper. We are able to show that the standard energy technique of finite element method for non-interface parabolic problems can be extended to parabolic interface problems if we allow interface triangles to be curved triangles. Optimal pointwise-in-time error estimates in the L ²(Ω) and H ¹(Ω) norms are shown to hold for the semidiscrete scheme. A fully discrete scheme based on backward Euler method is analyzed and pointwise-in-time error estimates are derived. The interfaces are assumed to be arbitrary shape but smooth for our purpose.     

Two-Stage Method of Construction of Regularizing Algorithms for Nonlinear Ill-Posed Problems

For an equation with a nonlinear differentiable operator acting in a Hilbert space, we study a two-stage method of construction of a regularizing algorithm. First, we use the Lavrentiev regularization scheme. Then we apply to the regularized equation either Newton’s method or nonlinear analogs of α-processes: the minimum error method, the minimum residual method, and the steepest descent method. For these processes, we establish the linear convergence rate and the Fejér property of iterations. Two cases are considered: when the operator of the problem is monotone and when the operator is finite-dimensional and its derivative has nonnegative spectrum. For the two-stage method with a monotone operator, we give an error bound, which has optimal order on the class of sourcewise representable solutions. In the second case, the error of the method is estimated by means of the residual. The proposed methods and their modified analogs are implemented numerically for three-dimensional inverse problems of gravimetry and magnetometry. The results of the numerical experiment are discussed.     

Integrating Interval Estimates of Global Optima and Local Search Methods for Combinatorial Optimization Problems

The problem of estimating the global optimal values of intractable combinatorial optimization problems is of interest to researchers developing and evaluating heuristics for these problems. In this paper we present a method for combining statistical optimum prediction techniques with local search methods such as simulated annealing and tabu search and illustrate the approach on a single machine scheduling problem. Computational experiments show that the approach yields useful estimates of optimal values with very reasonable computational effort.     

Convergence Rates of First- and Higher-Order Dynamics for Solving Linear Ill-Posed Problems

Recently, there has been a great interest in analysing dynamical flows, where the stationary limit is the minimiser of a convex energy. Particular flows of great interest have been continuous limits of Nesterov’s algorithm and the fast iterative shrinkage-thresholding algorithm, respectively. In this paper, we approach the solutions of linear ill-posed problems by dynamical flows. Because the squared norm of the residual of a linear operator equation is a convex functional, the theoretical results from convex analysis for energy minimising flows are applicable. However, in the restricted situation of this paper they can often be significantly improved. Moreover, since we show that the proposed flows for minimising the norm of the residual of a linear operator equation are optimal regularisation methods and that they provide optimal convergence rates for the regularised solutions, the given rates can be considered the benchmarks for further studies in convex analysis.

     

Error Estimates for the Approximation of the Effective Hamiltonian

We study approximation schemes for the cell problem arising in homogenization of Hamilton-Jacobi equations. We prove several error estimates concerning the rate of convergence of the approximation scheme to the effective Hamiltonian, both in the optimal control setting and as well as in the calculus of variations setting. D.G. was partially supported by the Center for Mathematical Analysis, Geometry and Dynamical Systems through FCT Program POCTI/FEDER and by grant POCI/FEDER/MAT/55745/2004.     

一类障碍问题解梯度的局部和边界更高可积性

本文考虑了主部为非线性的障碍问题 ,先证明了其弱解的梯度的更高可积性 ;然后 ,在边界满足P Poincar啨厚的情况下证明了解梯度的边界更高可积性     

Error Estimates for Linear Finite Elements on Bakhvalov-Type Meshes

For convection-diffusion problems with exponential layers, optimal error estimates for linear finite elements on Shishkin-type meshes are known. We present the first optimal convergence result in an energy norm for a Bakhvalov-type mesh.     

A Posteriori Error Estimates for Axisymmetric and Nonlinear Problems

We propose and examine the primal and dual finite element method for solving an axially symmetric elliptic problem with mixed boundary conditions. We derive an a posteriori error estimate and generalize the method used for a nonlinear elliptic problem. Finally, an a posteriori error estimate for a nonlinear parabolic problem based on the concept of hierarchical finite element basis functions is introduced.     

Decay Estimates for Solutions of Linear Elasticity for Anisotropic Media

We analyse the time decay of solutions to the Cauchy problem for the linear hyperbolic system of elasticity for anisotropic media. As an example, we will consider media with hexagonal symmetry. First we derive decay estimates for special initial data using the method of stationary phase in several variables and degenerate phase function based on the Malgrange preparation theorem. Asymptotic expansions are given to prove the sharpness of the weaker time decay found for zinc and beryl than in the isotropic case. A method using Besov spaces leads to ℒ︁^p–ℒ︁^q-estimates.     

A Posteriori Error Estimates and a Local Refinement Strategy for a Finite Element Method to Solve Structural-Acoustic Vibration Problems

This paper deals with an adaptive technique to compute structural-acoustic vibration modes. It is based on an a posteriori error estimator for a finite element method free of spurious or circulation nonzero-frequency modes. The estimator is shown to be equivalent, up to higher order terms, to the approximate eigenfunction error, measured in a useful norm; moreover, the equivalence constants are independent of the corresponding eigenvalue, the physical parameters, and the mesh size. This a posteriori error estimator yields global upper and local lower bounds for the error and, thus, it may be used to design adaptive algorithms. We propose a local refinement strategy based on this estimator and present a numerical test to assess the efficiency of this technique.     

On Mixed Error Estimates for Elliptic Obstacle Problems

We establish in this paper sharp error estimates of residual type for finite element approximation to elliptic obstacle problems. The estimates are of mixed nature, which are neither of a pure a priori form nor of a pure a posteriori form but instead they are combined by an a priori part and an a posteriori part. The key ingredient in our derivation for the mixed error estimates is the use of a new interpolator which enables us to eliminate inactive data from the error estimators. One application of our mixed error estimates is to construct a posteriori error indicators reliable and efficient up to higher order terms, and these indicators are useful in mesh-refinements and adaptive grid generations. In particular, by approximating the a priori part with some a posteriori quantities we can successfully track the free boundary for elliptic obstacle problems.     

Optimal Interior and Local Error Estimates of a Recovered Gradient of Linear Elements on Nonuniform Triangulations

1.IntroductionConsideramodelellipticboundaryvalueproblemwhereflCRd,d=1,2,3,isaboundedpolyhedraldomainwithaLip8chitzboundaryfEL'(fl),aijareLipschitz-continuousfunctionsandthematrixA=(aij)issymmetricanduniformlypositivedefinitewithrespecttoxEn.Itisknownthatthefiniteelementmethodappliedto(1.1)mayproducesomesuperconvergencephenomenaeveniftheusedmeshesarenonuniform[5'8'9'1o'121.InarecentpaPer[61,aninteriorerrorestimatefortherecoveredgradientofGalerkinpiecewiselinearaPproximationshasbeenproposed…     

Local and Global Existence of Solutions to Initial Value Problems of Modified Nonlinear Kawahara Equations

This paper is devoted to studying the initial value problem of the modified nonlinear Kawahara equation the first partial dervative of u to t ,the second the third ＋α the second partial dervative of u to x ,the second the third ＋β the third partial dervative of u to x ,the second the thire ＋γ the fifth partial dervative of u to x = 0,（x,t）∈R^2.We first establish several Strichartz type estimates for the fundamental solution of the corresponding linear problem. Then we apply such estimates to prove local and global existence of solutions for the initial value problem of the modified nonlinear Karahara equation. The results show that a local solution exists if the initial function uo（x） ∈ H^s（R） with s ≥ 1/4, and a global solution exists if s ≥ 2.