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

Page 1 Next

Displaying 1 – 20 of 31

Showing per page

A brief review of some application driven fast algorithms for elliptic partial differential equations

Prabir Daripa (2012)

Open Mathematics

Some application driven fast algorithms developed by the author and his collaborators for elliptic partial differential equations are briefly reviewed here. Subsequent use of the ideas behind development of these algorithms for further development of other algorithms some of which are currently in progress is briefly mentioned. Serial and parallel implementation of these algorithms and their applications to some pure and applied problems are also briefly reviewed.

A fast numerical test of multivariate polynomial positiveness with applications

Petr Augusta, Petra Augustová (2018)

Kybernetika

The paper presents a simple method to check a positiveness of symmetric multivariate polynomials on the unit multi-circle. The method is based on the sampling polynomials using the fast Fourier transform. The algorithm is described and its possible applications are proposed. One of the aims of the paper is to show that presented algorithm is significantly faster than commonly used method based on the semi-definite programming expression.

A globally convergent non-interior point algorithm with full Newton step for second-order cone programming

Liang Fang, Guoping He, Li Sun (2009)

Applications of Mathematics

A non-interior point algorithm based on projection for second-order cone programming problems is proposed and analyzed. The main idea of the algorithm is that we cast the complementary equation in the primal-dual optimality conditions as a projection equation. By using this reformulation, we only need to solve a system of linear equations with the same coefficient matrix and compute two simple projections at each iteration, without performing any line search. This algorithm can start from an arbitrary...

A modified limited-memory BNS method for unconstrained minimization derived from the conjugate directions idea

Vlček, Jan, Lukšan, Ladislav (2015)

Programs and Algorithms of Numerical Mathematics

A modification of the limited-memory variable metric BNS method for large scale unconstrained optimization of the differentiable function f : ℛ N → ℛ is considered, which consists in corrections (based on the idea of conjugate directions) of difference vectors for better satisfaction of the previous quasi-Newton conditions. In comparison with [11], more previous iterations can be utilized here. For quadratic objective functions, the improvement of convergence is the best one in some sense, all stored corrected...

A new finite element approach for problems containing small geometric details

Wolfgang Hackbusch, Stefan A. Sauter (1998)

Archivum Mathematicum

In this paper a new finite element approach is presented which allows the discretization of PDEs on domains containing small micro-structures with extremely few degrees of freedom. The applications of these so-called Composite Finite Elements are two-fold. They allow the efficient use of multi-grid methods to problems on complicated domains where, otherwise, it is not possible to obtain very coarse discretizations with standard finite elements. Furthermore, they provide a tool for discrete homogenization...

A new one-step smoothing newton method for second-order cone programming

Jingyong Tang, Guoping He, Li Dong, Liang Fang (2012)

Applications of Mathematics

In this paper, we present a new one-step smoothing Newton method for solving the second-order cone programming (SOCP). Based on a new smoothing function of the well-known Fischer-Burmeister function, the SOCP is approximated by a family of parameterized smooth equations. Our algorithm solves only one system of linear equations and performs only one Armijo-type line search at each iteration. It can start from an arbitrary initial point and does not require the iterative points to be in the sets...

A posteriori error estimates for elliptic problems with Dirac measure terms in weighted spaces

Juan Pablo Agnelli, Eduardo M. Garau, Pedro Morin (2014)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

In this article we develop a posteriori error estimates for second order linear elliptic problems with point sources in two- and three-dimensional domains. We prove a global upper bound and a local lower bound for the error measured in a weighted Sobolev space. The weight considered is a (positive) power of the distance to the support of the Dirac delta source term, and belongs to the Muckenhoupt’s class A2. The theory hinges on local approximation properties of either Clément or Scott–Zhang interpolation...

A posteriori error estimates for linear exterior problems via mixed-FEM and DtN mappings

Mauricio A. Barrientos, Gabriel N. Gatica, Matthias Maischak (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

In this paper we combine the dual-mixed finite element method with a Dirichlet-to-Neumann mapping (given in terms of a boundary integral operator) to solve linear exterior transmission problems in the plane. As a model we consider a second order elliptic equation in divergence form coupled with the Laplace equation in the exterior unbounded region. We show that the resulting mixed variational formulation and an associated discrete scheme using Raviart-Thomas spaces are well posed, and derive the...

Currently displaying 1 – 20 of 31

Page 1 Next