This paper presents optimal recursive estimators for vector valued Gauss-Markov random fields taking values in R and indexed by (intervals of) R or Z. These 1-D fields are often called reciprocal processes. They correspond to two point boundary value fields, i.e., they have boundary conditions given at the end points of the indexing interval. To obtain the recursive estimators, we derive two cl...

With the proliferation of Location-Based Services (LBS) and the increasing amount of geographic data, many issues arise related to the integration of spatial data and their visualization. The thesis’ objective aims at tackling these challenges by integrating LBS offered by multi-providers in the context of touristic Points Of Interests (POI). In this document, a short state of the art of data i...

In this paper we propose a new quadrature scheme for computing vibrational spectra and apply it, using a Lanczos algorithm, to CH(3)CN. All 12 coordinates are treated explicitly. We need only 157'419'523 quadrature points. It would not be possible to use a product Gauss grid because 33 853 318 889 472 product Gauss points would be required. The nonproduct quadrature we use is based on ideas of ...

We have implemented in Matlab a Gauss-like cubature formula over bivariate domains with a piecewise regular boundary, which is tracked by splines of maximum degree p (spline curvilinear polygons). The formula is exact for polynomials of degree at most 2n− 1 using N ∼ cmn nodes, 1 ≤ c ≤ p, m being the total number of points given on the boundary. It does not need any decomposition of the domain,...

Aiming at a fast and robust simulation of large multibody systems with contacts and friction, this work presents a novel method for solving large cone complementarity problems by means of a fixed-point iteration. The method is an extension of the Gauss-Seidel and Gauss-Jacobi method with overrelaxation for symmetric convex linear complementarity problems. The method is proved to be convergent u...

We have implemented in Matlab a Gauss-like cubature formula over arbitrary bivariate domains with a piecewise regular boundary, which is tracked by splines of maximum degree p (spline curvilinear polygons). The formula is exact for polynomials of degree at most 2n− 1 using N ∼ cmn2 nodes, 1 ≤ c ≤ p, m being the total number of points given on the boundary. It does not need any decomposition of ...

The subject of research is the numerical integration of atmospheric chemical kinetics systems. The application lies in the study of air pollution, modelled by atmospheric chemistry-transport problems. This application puts high demands on the eeciency of the stii solver. Three explicit methods are discussed and compared for a selected chemical kinetics system which is representative for the sta...

A new machine-learning based multiscale method, called k-means FE 2 , is introduced to solve general nonlinear problems with internal variables and loading history-dependent behaviors, without use of surrogate models. The macro scale problem reduced by constructing clusters Gauss points in a structure which are estimated be the same mechanical state. clustering—machine learning technique employ...

The goal of this paper is to describe Zermelo’s navigation problem on Riemannian manifolds as a time-optimal control problem and give an efficient method in order to evaluate its control curvature. We will show that up to changing the Riemannian metric on the manifold the control curvature of Zermelo’s problem has a simple to handle expression which naturally leads to a generalization of the cl...

Motivated by a problem considered earlier by Schrodinger [1]{[2], Jamison [3]{[4] and others, we examine in this paper the construction of Gauss-Markov processes with xed reciprocal dynamics. Given the class of reciprocal processes speci ed by a second-order model, a procedure is described for constructing a Markov process in the class with preassigned marginal probability densities at the end...