We construct a fast method, OðN logNÞ, for the computation of discrete Gauss transforms with complex parameters, capable of dealing with unequally spaced grid points. The method is based on Fourier techniques, and in particular it makes use of a modified unequally spaced fast Fourier transform algorithm, in combination with previously suggested divide and conquer strategies for ordinary fast Ga...

A new algorithm for solving the general nonlinear third-order differential equation is developed by means of a shifted Jacobi-Gauss collocation spectral method. The shifted Jacobi-Gauss points are used as collocation nodes. Numerical examples are included to demonstrate the validity and applicability of the proposed algorithm, and some comparisons are made with the existing results. The method ...

We propose a new value iteration method for the classical average cost Markovian decision problem, under the assumption that all stationary policies are unichain and that, furthermore, there exists a state that is recurrent under all stationary policies. This method is motivated by a relation between the average cost problem and an associated stochastic shortest path problem. Contrary to the st...

In this paper, we report that we have solved the SVP Challenge over a 128-dimensional lattice in Ideal Lattice Challenge from TU Darmstadt, which is currently the highest dimension in the challenge that has ever been solved. The security of lattice-based cryptography is based on the hardness of solving the shortest vector problem (SVP) in lattices. In 2010, Micciancio and Voulgaris proposed a G...

In the paper, we advance a numerical technique for enclosing generalized AE-solution sets to interval linear systems. The main result of the paper is an extension of the well-known interval Gauss-Seidel method to the problems of outer estimation of these generalized solution sets. We give a theoretical study of the new method, prove an optimality property for the generalized interval Gauss-Seid...

Two trust-region methods for systems of mixed nonlinear equalities, general inequalities and simple bounds are proposed. The first method is based on a Gauss-Newton model, the second one is based on a regularized Gauss-Newton model and results to be a Levenberg-Marquardt method. The globalization strategy uses affine scaling matrices arising in bound-constrained optimization. Global convergence...