13 resultados para Implicit finite difference approximation scheme
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
2000 Mathematics Subject Classification: 65M06, 65M12.
Resumo:
2000 Mathematics Subject Classification: 65M06, 65M12.
Resumo:
In this paper we propose an optimized algorithm, which is faster compared to previously described finite difference acceleration scheme, namely the Modified Super-Time-Stepping (Modified STS) scheme for age-structured population models with difusion.
Resumo:
In this paper we propose an optimized algorithm, which is faster compared to previously described finite difference acceleration scheme, namely the Modified Super-Time-Stepping (Modified STS) scheme for age- structured population models with diffusion.
Resumo:
We deal with a class of elliptic eigenvalue problems (EVPs) on a rectangle Ω ⊂ R^2 , with periodic or semi–periodic boundary conditions (BCs) on ∂Ω. First, for both types of EVPs, we pass to a proper variational formulation which is shown to fit into the general framework of abstract EVPs for symmetric, bounded, strongly coercive bilinear forms in Hilbert spaces, see, e.g., [13, §6.2]. Next, we consider finite element methods (FEMs) without and with numerical quadrature. The aim of the paper is to show that well–known error estimates, established for the finite element approximation of elliptic EVPs with classical BCs, hold for the present types of EVPs too. Some attention is also paid to the computational aspects of the resulting algebraic EVP. Finally, the analysis is illustrated by two non-trivial numerical examples, the exact eigenpairs of which can be determined.
Resumo:
In this paper, we are concerned with the optimal control boundary control of a second order parabolic heat equation. Using the results in [Evtushenko, 1997] and spatial central finite difference with diagonally implicit Runge-Kutta method (DIRK) is applied to solve the parabolic heat equation. The conjugate gradient method (CGM) is applied to solve the distributed control problem. Numerical results are reported.
Resumo:
This paper is partially supported by project ISM-4 of Department for Scientific Research, “Paisii Hilendarski” University of Plovdiv.
Resumo:
In this paper, we are considered with the optimal control of a schrodinger equation. Based on the formulation for the variation of the cost functional, a gradient-type optimization technique utilizing the finite difference method is then developed to solve the constrained optimization problem. Finally, a numerical example is given and the results show that the method of solution is robust.
Resumo:
AMS subject classification: 49J52, 90C30.
Resumo:
We consider a model eigenvalue problem (EVP) in 1D, with periodic or semi–periodic boundary conditions (BCs). The discretization of this type of EVP by consistent mass finite element methods (FEMs) leads to the generalized matrix EVP Kc = λ M c, where K and M are real, symmetric matrices, with a certain (skew–)circulant structure. In this paper we fix our attention to the use of a quadratic FE–mesh. Explicit expressions for the eigenvalues of the resulting algebraic EVP are established. This leads to an explicit form for the approximation error in terms of the mesh parameter, which confirms the theoretical error estimates, obtained in [2].
Resumo:
* This work has been supported by the Office of Naval Research Contract Nr. N0014-91-J1343, the Army Research Office Contract Nr. DAAD 19-02-1-0028, the National Science Foundation grants DMS-0221642 and DMS-0200665, the Deutsche Forschungsgemeinschaft grant SFB 401, the IHP Network “Breaking Complexity” funded by the European Commission and the Alexan- der von Humboldt Foundation.
Resumo:
We are concerned with two-level optimization problems called strongweak Stackelberg problems, generalizing the class of Stackelberg problems in the strong and weak sense. In order to handle the fact that the considered two-level optimization problems may fail to have a solution under mild assumptions, we consider a regularization involving ε-approximate optimal solutions in the lower level problems. We prove the existence of optimal solutions for such regularized problems and present some approximation results when the parameter ǫ goes to zero. Finally, as an example, we consider an optimization problem associated to a best bound given in [2] for a system of nondifferentiable convex inequalities.
Resumo:
Mathematics Subject Classification: 65C05, 60G50, 39A10, 92C37