This work presents efficient solution techniques for radiative transfer in the smoothed particle hydrodynamics discretization. Two choices that impact efficiency are how material and radiation energy coupled, which determines number of iterations needed to converge emission source, diffusion equation is solved, must be done each iteration. The coupled equations solved using an inexact Newton it...

We apply a Runge-Kutta-based waveform relaxation method to initial-value problems for implicit differential equations. In the implementation of such methods, a sequence of nonlinear systems has to be solved iteratively in each step of the integration process. The size of these systems increases linearly with the number of stages of the underlying Runge-Kutta method, resulting in high linear alg...

Asynchronous events sequences are widely distributed in the natural world and human activities, such as earthquakes records, users’ activities social media, so on. How to distill information from these seemingly disorganized data is a persistent topic that researchers focus One of most useful models point process model, on basis, obtain many noticeable results. Moreover, recent years, foundatio...

We present an improved version of an infeasible interior-point method for linear optimization published in 2006. In the earlier version each iteration consisted of one so-called feasibility step and a few – at most three – centering steps. In this paper each iteration consists of only a feasibility step, whereas the iteration bound improves the earlier bound by a factor 2 √ 2. The improvements ...

‎A full Nesterov-Todd (NT) step infeasible interior-point algorithm‎ ‎is proposed for solving monotone linear complementarity problems‎ ‎over symmetric cones by using Euclidean Jordan algebra‎. ‎Two types of‎ ‎full NT-steps are used‎, ‎feasibility steps and centering steps‎. ‎The‎ ‎algorithm starts from strictly feasible iterates of a perturbed‎ ‎problem‎, ‎and, using the central path and feasi...

A reliable technique for deductive program verification should be proven sound with respect to the semantics of programming language. For each different language, construction a separate soundness proof is often laborious undertaking. In language-independent verification, common aspects computer programs are addressed enable reasoning all languages. this work, we propose solution about iteratio...