A modified least action principle allowing mass concentrations for the early universe reconstruction problem
Texte intégral
Documents relatifs
Our method uses the geometrical properties of the vector field given by the ODE and a state space discretization to compute an enclosure of the trajectories set that verifies the
In Section 3 we revisit the semi- discrete in time approximation of [10] and we improve some results, for example we prove uniform L ∞ bounds for the solutions of the
Because this problem is an NP- hard problem there is not a known deterministic efficient (polinomial) method. Non- deterministic methods are in general more efficient but an
Our convergence proof takes a fairly standard path, namely a priori estimates on the space semi-discrete solutions and compactness arguments, but the mass modification at the
Keywords: Finite volume method - High order method - k-exact method - Cubic reconstruction - Numerical flux - Linear stability - Irregular grid - Coupled Least Squares.. Finite
Our method uses the geometrical properties of the vector field given by the ODE and a state space discretization to compute an enclosure of the trajectories set that verifies the
Abstract- An approximate direct method for solving linear and nonlinear heat conduction problems, based on the Gauss's principle of least constraint is
On one hand, the dis- cretization of the pressure gradient term is built as the discrete transposed of the velocity divergence term, the latter being evaluated using a natural