Qualitative properties of the solutions to the Navier-Stokes equations for compressible fluids
On the integral representation of the solution to the Stokes system
On the existence of stationary solutions to compressible Navier-Stokes equations
Periodic and stationary solutions for compressible Navier-Stokes equations via a stability method
L'equazione di Eulero dei fluidi bidimensionali in domini con frontiera variabile
We prove the existence of a unique solution (in classical sense) of the two-dimensional non-stationary Euler equation, in a bounded and simply-connected domain which dépendes on the time.
A free boundary problem for compressible viscous fluids.
Asymptotic Behaviour of the density for one-dimensional navier-stokes equations.
Some remarks on the characterization of the space of tangential traces of H(rot; ...) and the construction of an extension operator.
Filtrazione di un fluido in un mezzo non omogeneo tridimensionale
We prove the existence of a unique solution for a free boundary problem relative to the stationary flow between two water reservoirs of different levels separated by a non-homogeneous dam with variable cross section.
Domain decomposition algorithms for time-harmonic Maxwell equations with damping
Three non-overlapping domain decomposition methods are proposed for the numerical approximation of time-harmonic Maxwell equations with damping (i.e., in a conductor). For each method convergence is proved and, for the discrete problem, the rate of convergence of the iterative algorithm is shown to be independent of the number of degrees of freedom.
On the Euler equations for nonhomogeneous fluids (I)
On the motion of a non-homogeneous ideal incompressible fluid in an external force field
Domain Decomposition Algorithms for Time-Harmonic Maxwell Equations with Damping
Three non-overlapping domain decomposition methods are proposed for the numerical approximation of time-harmonic Maxwell equations with damping (, in a conductor). For each method convergence is proved and, for the discrete problem, the rate of convergence of the iterative algorithm is shown to be independent of the number of degrees of freedom.
Page 1