Displaying similar documents to “Efficient counting and asymptotics of k -noncrossing tangled diagrams.”

Time domain decomposition in final value optimal control of the Maxwell system

John E. Lagnese, G. Leugering (2002)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We consider a boundary optimal control problem for the Maxwell system with a final value cost criterion. We introduce a time domain decomposition procedure for the corresponding optimality system which leads to a sequence of uncoupled optimality systems of local-in-time optimal control problems. In the limit full recovery of the coupling conditions is achieved, and, hence, the local solutions and controls converge to the global ones. The process is inherently parallel and is suitable...

Some alternating sums of Lucas numbers

Zvonko Čerin (2005)

Open Mathematics

Similarity:

We consider alternating sums of squares of odd and even terms of the Lucas sequence and alternating sums of their products. These alternating sums have nice representations as products of appropriate Fibonacci and Lucas numbers.

Convergence of a Lagrange-Galerkin method for a fluid-rigid body system in ALE formulation

Guillaume Legendre, Takéo Takahashi (2008)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

We propose a numerical scheme to compute the motion of a two-dimensional rigid body in a viscous fluid. Our method combines the method of characteristics with a finite element approximation to solve an ALE formulation of the problem. We derive error estimates implying the convergence of the scheme.