The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
We propose a new Broyden method for solving systems of nonlinear equations, which uses the first derivatives, but is more efficient than the Newton method (measured by the computational time) for larger dense systems. The new method updates QR or LU decompositions of nonsymmetric approximations of the Jacobian matrix, so it requires arithmetic operations per iteration in contrast with the Newton method, which requires operations per iteration. Computational experiments confirm the high efficiency...
We compute numerically the minimizers of the Dirichlet energyamong maps from the unit disc into the unit sphere that satisfy a boundary condition and a degree condition. We use a Sobolev gradient algorithm for the minimization and we prove that its continuous version preserves the degree. For the discretization of the problem we use continuous finite elements. We propose an original mesh-refining strategy needed to preserve the degree with the discrete version of the algorithm (which is a preconditioned...
Estimates of the radius of convergence of Newton's methods for variational inclusions in Banach spaces are investigated under a weak Lipschitz condition on the first Fréchet derivative. We establish the linear convergence of Newton's and of a variant of Newton methods using the concepts of pseudo-Lipschitz set-valued map and ω-conditioned Fréchet derivative or the center-Lipschitz condition introduced by the first author.
An algorithm for quadratic minimization with simple bounds is introduced, combining, as many well-known methods do, active set strategies and projection steps. The novelty is that here the criterion for acceptance of a projected trial point is weaker than the usual ones, which are based on monotone decrease of the objective function. It is proved that convergence follows as in the monotone case. Numerical experiments with bound-constrained quadratic problems from CUTE collection show that the modified...
Shape optimization problems are optimal design problems in which the shape of the boundary plays the role of a design, i.e. the unknown part of the problem. Such problems arise in structural mechanics, acoustics, electrostatics, fluid flow and other areas of engineering and applied science. The mathematical theory of such kind of problems has been developed during the last twelve years. Recently the theory has been extended to cover also situations in which the behaviour of the system is governed...
In this paper, some ideas for the numerical realization of the hybrid proximal projection algorithm from Solodov and Svaiter [22] are presented. An example is given which shows that this hybrid algorithm does not generate a Fejér-monotone sequence. Further, a strategy is suggested for the computation of inexact solutions of the auxiliary problems with a certain tolerance. For that purpose, ε-subdifferentials of the auxiliary functions and the bundle trust region method from Schramm and Zowe [20]...
In the article the following optimal control problem is studied: to determine a certain coefficient in a quasilinear partial differential equation of parabolic type so that the solution of a boundary value problem for this equation would minimise a given integral functional. In addition to the design and analysis of a numerical method the paper contains the solution of the fundamental problems connected with the formulation of the problem in question (existence and uniqueness of the solution of...
In this paper we introduce a numerical approach adapted to the minimization of the eigenmodes of a membrane with respect to the domain. This method is based on the combination of the Level Set method of S. Osher and J.A. Sethian with the relaxed approach. This algorithm enables both changing the topology and working on a fixed regular grid.
In this paper we introduce a numerical approach adapted to the minimization
of the eigenmodes of a membrane with respect to the domain. This method is
based on the combination of the Level Set method of S. Osher and J.A.
Sethian with the relaxed approach. This algorithm enables both changing the
topology and working on a fixed regular grid.
A non-linear semi-coercive beam problem is solved in this article. Suitable numerical methods are presented and their uniform convergence properties with respect to the finite element discretization parameter are proved here. The methods are based on the minimization of the total energy functional, where the descent directions of the functional are searched by solving the linear problems with a beam on bilateral elastic ``springs''. The influence of external loads on the convergence properties is...
We present results on the estimation of unknown parameters in systems of ordinary differential equations in order to fit the output of models to real data. The numerical method is based on the nonlinear least squares problem along with the solution of sensitivity equations corresponding to the differential equations. We will present the performance of the method on the problem of fitting the output of basic compartmental epidemic models to data from the Covid-19 epidemic. This allows us to draw...
In this work we deal with the numerical solution of a
Hamilton-Jacobi-Bellman (HJB) equation with infinitely many
solutions. To compute the maximal solution – the optimal
cost of the original optimal control problem – we present a
complete discrete method based on the use of some finite elements
and penalization techniques.
We introduce a modification of the Monge–Kantorovitch problem of exponent 2 which accommodates non balanced initial and final densities. The augmented lagrangian numerical method introduced in [6] is adapted to this “unbalanced” problem. We illustrate the usability of this method on an idealized error estimation problem in meteorology.
We introduce a modification of the Monge–Kantorovitch
problem of exponent 2 which accommodates non balanced initial
and final densities. The augmented Lagrangian numerical method
introduced in [6] is adapted to this “unbalanced”
problem. We illustrate the usability of this method on an
idealized error estimation problem in meteorology.
Currently displaying 1 –
20 of
24