All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 77 Next

Displaying 1521 – 1540 of 9149

Showing per page

An implicit scheme to solve a system of ODEs arising from the space discretization of nonlinear diffusion equations

Éric Boillat (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

In this article, we consider the initial value problem which is obtained after a space discretization (with space step h) of the equations governing the solidification process of a multicomponent alloy. We propose a numerical scheme to solve numerically this initial value problem. We prove an error estimate which is not affected by the step size h chosen in the space discretization. Consequently, our scheme provides global convergence without any stability condition between h and the time...

An improved convergence analysis of Newton's method for twice Fréchet differentiable operators

Ioannis K. Argyros, Sanjay K. Khattri (2013)

Applicationes Mathematicae

We develop local and semilocal convergence results for Newton's method in order to solve nonlinear equations in a Banach space setting. The results compare favorably to earlier ones utilizing Lipschitz conditions on the second Fréchet derivative of the operators involved. Numerical examples where our new convergence conditions are satisfied but earlier convergence conditions are not satisfied are also reported.

An improvement of Euclid's algorithm

Zítko, Jan, Kuřátko, Jan (2010)

Programs and Algorithms of Numerical Mathematics

The paper introduces the calculation of a greatest common divisor of two univariate polynomials. Euclid’s algorithm can be easily simulated by the reduction of the Sylvester matrix to an upper triangular form. This is performed by using c - s transformation and Q R -factorization methods. Both procedures are described and numerically compared. Computations are performed in the floating point environment.

An Ingham type proof for a two-grid observability theorem

Michel Mehrenberger, Paola Loreti (2008)

ESAIM: Control, Optimisation and Calculus of Variations

Here, we prove the uniform observability of a two-grid method for the semi-discretization of the 1 D -wave equation for a time T > 2 2 ; this time, if the observation is made in ( - T / 2 , T / 2 ) , is optimal and this result improves an earlier work of Negreanu and Zuazua [C. R. Acad. Sci. Paris Sér. I 338 (2004) 413–418]. Our proof follows an Ingham type approach.

An Ingham type proof for a two-grid observability theorem

Paola Loreti, Michel Mehrenberger (2007)

ESAIM: Control, Optimisation and Calculus of Variations

Here, we prove the uniform observability of a two-grid method for the semi-discretization of the 1D-wave equation for a time T > 2 2 ; this time, if the observation is made in ( - T / 2 , T / 2 ) , is optimal and this result improves an earlier work of Negreanu and Zuazua [C. R. Acad. Sci. Paris Sér. I338 (2004) 413–418]. Our proof follows an Ingham type approach.

An instantaneous semi-Lagrangian approach for boundary control of a melting problem

Youness Mezzan, Moulay Hicham Tber (2021)

Applications of Mathematics

In this paper, a sub-optimal boundary control strategy for a free boundary problem is investigated. The model is described by a non-smooth convection-diffusion equation. The control problem is addressed by an instantaneous strategy based on the characteristics method. The resulting time independent control problems are formulated as function space optimization problems with complementarity constraints. At each time step, the existence of an optimal solution is proved and first-order optimality conditions...

An interior-point algorithm for semidefinite least-squares problems

Chafia Daili, Mohamed Achache (2022)

Applications of Mathematics

We propose a feasible primal-dual path-following interior-point algorithm for semidefinite least squares problems (SDLS). At each iteration, the algorithm uses only full Nesterov-Todd steps with the advantage that no line search is required. Under new appropriate choices of the parameter β which defines the size of the neighborhood of the central-path and of the parameter θ which determines the rate of decrease of the barrier parameter, we show that the proposed algorithm is well defined and converges...

Currently displaying 1521 – 1540 of 9149