Many statistical applications require the solution of a symmetric positive definite covariance matrix, sometimes with a large number of right-hand sides of a statistical independence nature. With preconditioning, the preconditioned matrix has almost all the eigenvalues clustered within a narrow range, except for a few extreme eigenvalues deviating from the range rapidly. We derive a deflated ve...

A compressible two-phase solver considering phase transition and thermodynamic effects is developed on OpenFOAM to numerically investigate the dynamics of single cavitation bubble collapse near rigid wall. grid independence analysis conducted, accuracy pressure field verified by comparing numerical results with experimental results. The emission process acoustic energy during discussed. Moreove...

MIUR Center for Science and Application of Advanced Computing Paradigms at the University of Padova, Italy Consorzio Roma Ricerche Roma, Italy International Centre for Mechanical Sciences, Udine, Italy Ente per le Nuove tecnologie, l’Energia e l’Ambiente, Roma, Italy Department of Information Engineering University of Padova, Italy ? IBM Power3@375MHz with 4 GB mem ? HPM Toolkit for performance...

In this work, we propose a robust and easily implemented algebraic multigrid method as a stand-alone solver or a preconditioner in Krylov subspace methods for solving either symmetric and positive definite or saddle point linear systems of equations arising from the finite element discretization of the vector Laplacian problem, linear elasticity problem in pure displacement and mixed displaceme...

A non-empty set X of a carrier A of an algebra A is called Q-independent if the equality of two term functions f and g of the algebra A on any finite system of elements a1, a2, . . . , an of X implies f(p(a1), p(a2), . . . , p(an)) = g(p(a1), p(a2), . . . , p(an)) for any mapping p ∈ Q. An algebra B is a retract of A if B is the image of a retraction (i.e. of an idempotent endomorphism of B). W...

Abstract The logical framework of Constrained Horn Clauses (CHC) models verification tasks from a variety domains, ranging safety properties in transition systems to modular programs with procedures. In this work we present Golem , flexible and efficient solver for satisfiability CHC over linear real integer arithmetic. provides flexibility architecture multiple back-end model-checking algorith...