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 58 Next

Displaying 1141 – 1160 of 9149

Showing per page

Acceleration of two-grid stabilized mixed finite element method for the Stokes eigenvalue problem

Xinlong Feng, Zhifeng Weng, Hehu Xie (2014)

Applications of Mathematics

This paper provides an accelerated two-grid stabilized mixed finite element scheme for the Stokes eigenvalue problem based on the pressure projection. With the scheme, the solution of the Stokes eigenvalue problem on a fine grid is reduced to the solution of the Stokes eigenvalue problem on a much coarser grid and the solution of a linear algebraic system on the fine grid. By solving a slightly different linear problem on the fine grid, the new algorithm significantly improves the theoretical error...

Acceleration properties of the hybrid procedure for solving linear systems

Anna Abkowicz, Claude Brezinski (1996)

Applicationes Mathematicae

The aim of this paper is to discuss the acceleration properties of the hybrid procedure for solving a system of linear equations. These properties are studied in a general case and in two particular cases which are illustrated by numerical examples.

Accurate and online-efficient evaluation of the a posteriori error bound in the reduced basis method

Fabien Casenave, Alexandre Ern, Tony Lelièvre (2014)

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

The reduced basis method is a model reduction technique yielding substantial savings of computational time when a solution to a parametrized equation has to be computed for many values of the parameter. Certification of the approximation is possible by means of an a posteriori error bound. Under appropriate assumptions, this error bound is computed with an algorithm of complexity independent of the size of the full problem. In practice, the evaluation of the error bound can become very sensitive...

Accurate calculations of Stationary Distributions and Mean First Passage Times in Markov Renewal Processes and Markov Chains

Jeffrey J. Hunter (2016)

Special Matrices

This article describes an accurate procedure for computing the mean first passage times of a finite irreducible Markov chain and a Markov renewal process. The method is a refinement to the Kohlas, Zeit fur Oper Res, 30, 197–207, (1986) procedure. The technique is numerically stable in that it doesn’t involve subtractions. Algebraic expressions for the special cases of one, two, three and four states are derived.Aconsequence of the procedure is that the stationary distribution of the embedded Markov...

Accurate numerical discretizations of non-conservative hyperbolic systems

Ulrik Skre Fjordholm, Siddhartha Mishra (2012)

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

We present an alternative framework for designing efficient numerical schemes for non-conservative hyperbolic systems. This approach is based on the design of entropy conservative discretizations and suitable numerical diffusion operators that mimic the effect of underlying viscous mechanisms. This approach is illustrated by considering two model non-conservative systems: Lagrangian gas dynamics in non-conservative form and a form of isothermal Euler equations. Numerical experiments demonstrating...

Accurate numerical discretizations of non-conservative hyperbolic systems

Ulrik Skre Fjordholm, Siddhartha Mishra (2011)

ESAIM: Mathematical Modelling and Numerical Analysis

We present an alternative framework for designing efficient numerical schemes for non-conservative hyperbolic systems. This approach is based on the design of entropy conservative discretizations and suitable numerical diffusion operators that mimic the effect of underlying viscous mechanisms. This approach is illustrated by considering two model non-conservative systems: Lagrangian gas dynamics in non-conservative form and a form of isothermal Euler equations. Numerical experiments demonstrating...

Accurate WKB Approximation for a 1D Problem with Low Regularity

Nier, F. (2008)

Serdica Mathematical Journal

2000 Mathematics Subject Classification: 34L40, 65L10, 65Z05, 81Q20.This article is concerned with the analysis of the WKB expansion in a classically forbidden region for a one dimensional boundary value Schrodinger equation with a non smooth potential. The assumed regularity of the potential is the one coming from a non linear problem and seems to be the critical one for which a good exponential decay estimate can be proved for the first remainder term. The treatment of the boundary conditions brings...

Adapting meshes and time-steps for phase change problems

Ricardo H. Nochetto, Alfred Schmidt, Claudio Verdi (1997)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

We address the numerical approximation of the two-phase Stefan problem and discuss an adaptive finite element method based on rigorous a posteriori error estimation and refinement/coarsening. We also investigate how to restrict coarsening for the resulting method to be stable and convergent. We review implementation issues associated with bisection and conclude with simulations of a persistent corner singularity, for which adaptivity is an essential tool.

Adaptive algorithm for stochastic Galerkin method

Ivana Pultarová (2015)

Applications of Mathematics

We introduce a new tool for obtaining efficient a posteriori estimates of errors of approximate solutions of differential equations the data of which depend linearly on random parameters. The solution method is the stochastic Galerkin method. Polynomial chaos expansion of the solution is considered and the approximation spaces are tensor products of univariate polynomials in random variables and of finite element basis functions. We derive a uniform upper bound to the strengthened Cauchy-Bunyakowski-Schwarz...

Adaptive Dantzig density estimation

K. Bertin, E. Le Pennec, V. Rivoirard (2011)

Annales de l'I.H.P. Probabilités et statistiques

The aim of this paper is to build an estimate of an unknown density as a linear combination of functions of a dictionary. Inspired by Candès and Tao’s approach, we propose a minimization of the ℓ1-norm of the coefficients in the linear combination under an adaptive Dantzig constraint coming from sharp concentration inequalities. This allows to consider a wide class of dictionaries. Under local or global structure assumptions, oracle inequalities are derived. These theoretical results are transposed...

Currently displaying 1141 – 1160 of 9149