The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 1501 – 1520 of 9172

Showing per page

An Extension of 3D Zernike Moments for Shape Description and Retrieval of Maps Defined in Rectangular Solids

Atilla Sit, Julie C Mitchell, George N Phillips, Stephen J Wright (2013)

Molecular Based Mathematical Biology

Zernike polynomials have been widely used in the description and shape retrieval of 3D objects. These orthonormal polynomials allow for efficient description and reconstruction of objects that can be scaled to fit within the unit ball. However, maps defined within box-shaped regions ¶ for example, rectangular prisms or cubes ¶ are not well suited to representation by Zernike polynomials, because these functions are not orthogonal over such regions. In particular, the representations require many...

An extension of Rothe's method to non-cylindrical domains

Komil Kuliev, Lars-Erik Persson (2007)

Applications of Mathematics

In this paper Rothe’s classical method is extended so that it can be used to solve some linear parabolic boundary value problems in non-cylindrical domains. The corresponding existence and uniqueness theorems are proved and some further results and generalizations are discussed and applied.

An Extension of the Auxiliary Problem Principle to Nonsymmetric Auxiliary Operators

A. Renaud, G. Cohen (2010)

ESAIM: Control, Optimisation and Calculus of Variations

To find a zero of a maximal monotone operator, an extension of the Auxiliary Problem Principle to nonsymmetric auxiliary operators is proposed. The main convergence result supposes a relationship between the main operator and the nonsymmetric component of the auxiliary operator. When applied to the particular case of convex-concave functions, this result implies the convergence of the parallel version of the Arrow-Hurwicz algorithm under the assumptions of Lipschitz and partial Dunn properties...

An hp-Discontinuous Galerkin Method for the Optimal Control Problem of Laser Surface Hardening of Steel

Gupta Nupur, Nataraj Neela (2011)

ESAIM: Mathematical Modelling and Numerical Analysis

In this paper, we discuss an hp-discontinuous Galerkin finite element method (hp-DGFEM) for the laser surface hardening of steel, which is a constrained optimal control problem governed by a system of differential equations, consisting of an ordinary differential equation for austenite formation and a semi-linear parabolic differential equation for temperature evolution. The space discretization of the state variable is done using an hp-DGFEM, time and control discretizations are based on a discontinuous Galerkin...

An hp-Discontinuous Galerkin Method for the Optimal Control Problem of Laser Surface Hardening of Steel

Gupta Nupur, Nataraj Neela (2011)

ESAIM: Mathematical Modelling and Numerical Analysis

In this paper, we discuss an hp-discontinuous Galerkin finite element method (hp-DGFEM) for the laser surface hardening of steel, which is a constrained optimal control problem governed by a system of differential equations, consisting of an ordinary differential equation for austenite formation and a semi-linear parabolic differential equation for temperature evolution. The space discretization of the state variable is done using an hp-DGFEM, time and control discretizations are based on a discontinuous Galerkin...

An IMEX scheme for reaction-diffusion equations: application for a PEM fuel cell model

István Faragó, Ferenc Izsák, Tamás Szabó, Ákos Kriston (2013)

Open Mathematics

An implicit-explicit (IMEX) method is developed for the numerical solution of reaction-diffusion equations with pure Neumann boundary conditions. The corresponding method of lines scheme with finite differences is analyzed: explicit conditions are given for its convergence in the ‖·‖∞ norm. The results are applied to a model for determining the overpotential in a proton exchange membrane (PEM) fuel cell.

An imperfect conjugate gradient algorithm

Fridrich Sloboda (1982)

Aplikace matematiky

A new biorthogonalization algorithm is defined which does not depend on the step-size used. The algorithm is suggested so as to minimize the total error after n steps if imperfect steps are used. The majority of conjugate gradient algorithms are sensitive to the exactness of the line searches and this phenomenon may destroy the global efficiency of these algorithms.

Currently displaying 1501 – 1520 of 9172