Displaying similar documents to “Symmetric parareal algorithms for hamiltonian systems”

A multi-D model for Raman amplification

Mathieu Colin, Thierry Colin (2011)

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

Similarity:

In this paper, we continue the study of the Raman amplification in plasmas that we initiated in [Colin and Colin, 17 (2004) 297–330; Colin and Colin, 193 (2006) 535–562]. We point out that the Raman instability gives rise to three components. The first one is collinear to the incident laser pulse and counter propagates. In 2-D, the two other ones make a non-zero angle with the initial pulse and propagate forward. Furthermore they are symmetric with respect to the direction of propagation...

Numerical Analysis of the Adiabatic Variable Method for the Approximation of the Nuclear Hamiltonian

Yvon Maday, Gabriel Turinici (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

Many problems in quantum chemistry deal with the computation of fundamental or excited states of molecules and lead to the resolution of eigenvalue problems. One of the major difficulties in these computations lies in the very large dimension of the systems to be solved. Indeed these eigenfunctions depend on variables where stands for the number of particles (electrons and/or nucleari) in the molecule. In order to diminish the size of the systems to be solved, the chemists have...

Analysis of a near-metric TSP approximation algorithm

Sacha Krug (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

The traveling salesman problem (TSP) is one of the most fundamental optimization problems. We consider the -metric traveling salesman problem ( -TSP), , the TSP restricted to graphs satisfying the -triangle inequality ({}) ≤ (({}) + ({})), for some cost function and any three vertices . The well-known path matching Christofides algorithm (PMCA) guarantees an approximation ratio of 3 /2 and is the best known algorithm for the -TSP, for 1 ≤  ≤ 2....

On Numerical Solution of the Gardner–Ostrovsky Equation

M. A. Obregon, Y. A. Stepanyants (2012)

Mathematical Modelling of Natural Phenomena

Similarity:

A simple explicit numerical scheme is proposed for the solution of the Gardner–Ostrovsky equation ( + + + + ) = which is also known as the extended rotation-modified Korteweg–de Vries (KdV) equation. This equation is used for the description of internal oceanic waves affected by Earth’ rotation. Particular...

The Kaṭapayādi system of numerical notation and its spread outside Kerala

Sreeramula Rajeswara Sarma (2012)

Revue d'histoire des mathématiques

Similarity:

While the study of the transmission of scientific ideas from and to India has its own importance, it is also necessary to examine the transmission of ideas within India, from one region to another, from Sanskrit to regional languages and vice versa. This paper attempts to map the spread of the system of numerical notation, widely popular in Kerala, to other parts of India, and shows that this very useful tool of mathematical notation, though well known in northern India, was rarely...

New algorithms for coupled tasks scheduling – a survey

Jacek Blazewicz, Grzegorz Pawlak, Michal Tanas, Wojciech Wojciechowicz (2012)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The coupled tasks scheduling problem is a class of scheduling problems introduced for beam steering software of sophisticated radar devices, called phased arrays. Due to increasing popularity of such radars, the importance of coupled tasks scheduling is constantly growing. Unfortunately, most of the coupled tasks problems are NP-hard, and only a few practically usable algorithms for such problems were found. This paper provides a survey of already known complexity results of various...

Robust operator estimates and the application to substructuring methods for first-order systems

Christian Wieners, Barbara Wohlmuth (2014)

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

Similarity:

We discuss a family of discontinuous Petrov–Galerkin (DPG) schemes for quite general partial differential operators. The starting point of our analysis is the DPG method introduced by [Demkowicz , 49 (2011) 1788–1809; Zitelli , 230 (2011) 2406–2432]. This discretization results in a sparse positive definite linear algebraic system which can be obtained from a saddle point problem by an element-wise Schur complement reduction applied to the test space. Here, we show that the abstract...

Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine

Philippe Chrétienne (2010)

RAIRO - Operations Research

Similarity:

Assume that tasks must be processed by one machine in a fixed sequence. The processing time, the preferred starting time and the earliness and tardiness costs per time unit are known for each task. The problem is to allocate each task a starting time such that the total cost incurred by the early and tardy tasks is minimum. Garey have proposed a nice log) algorithm for the special case of symmetric and task-independent costs. In this paper we first extend that algorithm to...

Computing and proving with pivots

Frédéric Meunier (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A simple idea used in many combinatorial algorithms is the idea of . Originally, it comes from the method proposed by Gauss in the 19th century for solving systems of linear equations. This method had been extended in 1947 by Dantzig for the famous simplex algorithm used for solving linear programs. From since, a pivoting algorithm is a method exploring subsets of a ground set and going from one subset to a new one ′ by deleting an element inside and adding an element outside : ′ =  ...

Analysis of an Asymptotic Preserving Scheme for Relaxation Systems

Francis Filbet, Amélie Rambaud (2013)

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

Similarity:

We consider an asymptotic preserving numerical scheme initially proposed by F. Filbet and S. Jin [229 (2010)] and G. Dimarco and L. Pareschi [49 (2011) 2057–2077] in the context of nonlinear and stiff kinetic equations. Here, we propose a convergence analysis of such a scheme for the approximation of a system of transport equations with a nonlinear source term, for which the asymptotic limit is given by a conservation law. We investigate the convergence of the approximate solution ( ...

Inequality-sum: a global constraint capturing the objective function

Jean-Charles Régin, Michel Rueher (2010)

RAIRO - Operations Research

Similarity:

This paper introduces a new method to prune the domains of the variables in constrained optimization problems where the objective function is defined by a sum , and where the integer variables are subject to difference constraints of the form . An important application area where such problems occur is deterministic scheduling with the as optimality criteria. This new constraint is also more general than a sum constraint defined on a set of ordered variables. Classical...

Risk bounds for new M-estimation problems

Nabil Rachdi, Jean-Claude Fort, Thierry Klein (2013)

ESAIM: Probability and Statistics

Similarity:

In this paper, we consider a new framework where two types of data are available: experimental data supposed to be i.i.d from and outputs from a simulated reduced model. We develop a procedure for parameter estimation to characterize a feature of the phenomenon . We prove a risk bound qualifying the proposed procedure in terms of the number of experimental data , reduced model complexity...