Search results for " computational"
showing 10 items of 661 documents
Energy-stable linear schemes for polymer-solvent phase field models
2017
We present new linear energy-stable numerical schemes for numerical simulation of complex polymer-solvent mixtures. The mathematical model proposed by Zhou, Zhang and E (Physical Review E 73, 2006) consists of the Cahn-Hilliard equation which describes dynamics of the interface that separates polymer and solvent and the Oldroyd-B equations for the hydrodynamics of polymeric mixtures. The model is thermodynamically consistent and dissipates free energy. Our main goal in this paper is to derive numerical schemes for the polymer-solvent mixture model that are energy dissipative and efficient in time. To this end we will propose several problem-suited time discretizations yielding linear scheme…
GPU accelerated Monte Carlo simulations of lattice spin models
2011
We consider Monte Carlo simulations of classical spin models of statistical mechanics using the massively parallel architecture provided by graphics processing units (GPUs). We discuss simulations of models with discrete and continuous variables, and using an array of algorithms ranging from single-spin flip Metropolis updates over cluster algorithms to multicanonical and Wang-Landau techniques to judge the scope and limitations of GPU accelerated computation in this field. For most simulations discussed, we find significant speed-ups by two to three orders of magnitude as compared to single-threaded CPU implementations.
Computable majorants of the limit load in Hencky’s plasticity problems
2018
Abstract We propose a new method for analyzing the limit (safe) load of elastoplastic media governed by the Hencky plasticity law and deduce fully computable bounds of this load. The main idea of the method is based on a combination of kinematic approach and new estimates of the distance to the set of divergence free fields. We show that two sided bounds of the limit load are sharp and the computational efficiency of the method is confirmed by numerical experiments.
Role of Weak Hydrogen Bonds and Halogen Bonds in 5-Halo-1,3-dimethyluracils and Their Cocrystals—A Combined Experimental and Computational Study
2016
Seven single crystals containing either N,N-dimethyluracil (DMHU) or one of its 5-halogenated derivatives (DMXU; X = F, Cl, Br, I) were prepared using N,N-dimethylformamide as the crystallization solvent. Single crystal X-ray diffraction and quantum chemical calculations carried out at the spin component scaled local MP2 level of theory were then used to study the intramolecular halogen and nonconventional hydrogen bonds present in the structures. The results were compared to and contrasted with the previously reported data for uracil and its halogenated derivatives. In particular, the intermolecular interactions in DMIU were compared to the halogen and hydrogen bonds in 5-iodouracil that, …
Implicit perception simplicity and explicit perception complexity in sensorimotor communication: Comment on "The body talks: Sensorimotor communicati…
2019
[No abstract available]
Probabilistic Logic under Coherence: Complexity and Algorithms
2005
In previous work [V. Biazzo, A. Gilio, T. Lukasiewicz and G. Sanfilippo, Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in System P, Journal of Applied Non-Classical Logics 12(2) (2002) 189---213.], we have explored the relationship between probabilistic reasoning under coherence and model-theoretic probabilistic reasoning. In particular, we have shown that the notions of g-coherence and of g-coherent entailment in probabilistic reasoning under coherence can be expressed by combining notions in model-theoretic probabilistic reasoning with concepts from default reasoning. In this paper, we continue this line of research. Based on the above sem…
An Optimized Architecture for CGA Operations and Its Application to a Simulated Robotic Arm
2022
Conformal geometric algebra (CGA) is a new geometric computation tool that is attracting growing attention in many research fields, such as computer graphics, robotics, and computer vision. Regarding the robotic applications, new approaches based on CGA have been proposed to efficiently solve problems as the inverse kinematics and grasping of a robotic arm. The hardware acceleration of CGA operations is required to meet real-time performance requirements in embedded robotic platforms. In this paper, we present a novel embedded coprocessor for accelerating CGA operations in robotic tasks. Two robotic algorithms, namely, inverse kinematics and grasping of a human-arm-like kinematics chain, ar…
Web mining e Application Programming Interfaces: caratteristiche, strumenti, prospettive e limiti
2014
Sobre substitució lingüística i autòmats cel.lulars (SLAC): decurs de la investigació
2010
Hem optat per focalitzar la nostra investigació, tot i l'ampla aplicabilitat de la recerca, en la detecció del futur de la nostra llengua a partir dels pressupòsits de la Psicologia Social Computacional. I això mitjançant la utilització de la simulació informàtica, basada en els autòmats cel·lulars, que ha donat els primers resultats que presentem i explicitem en la nostra aportació a l'ANUARI. Així, hi abordem el futur de la llengua pròpia a partir de la conducta referida als parlants del País Valencià i amb la intenció d'esbrinar la reversió de la substitució lingüística.
Approximate Taylor methods for ODEs
2017
Abstract A new method for the numerical solution of ODEs is presented. This approach is based on an approximate formulation of the Taylor methods that has a much easier implementation than the original Taylor methods, since only the functions in the ODEs, and not their derivatives, are needed, just as in classical Runge–Kutta schemes. Compared to Runge–Kutta methods, the number of function evaluations to achieve a given order is higher, however with the present procedure it is much easier to produce arbitrary high-order schemes, which may be important in some applications. In many cases the new approach leads to an asymptotically lower computational cost when compared to the Taylor expansio…