2. Write a Matlab script of no more than 10 lines to calculate the Newton-Cotes quadrature weights wj , j = 1, 2, . . . , n, n + 1; go to the end of this handout for more details about wj . For uniformity, we require that the script starts with the four lines n=2; h=1/n; nodes=(0:h:1)’; f=eye(n+1); where the j-th column of the matrix f are needed for the Lagrange interpolation in order to find ...

Self-concordant functions are a special class of convex functions in Euclidean space introduced by Nesterov. They are used in interior point methods, based on Newton iterations, where they play an important role in solving efficiently certain constrained optimization problems. The concept of self-concordant functions has been defined on Riemannian manifolds by Jiang et al. and a damped Newton m...

A fast method of an arbitrary high order for approximating volume potentials is proposed, which is effective also in high dimensional cases. Basis functions introduced in the theory of approximate approximations are used. Results of numerical experiments, which show approximation order O(h8) for the Newton potential in high dimensions, for example, for n = 200 000, are provided. The computation...

The generalized Nash equilibrium is a Nash game, where not only the players’ cost functions, but also the constraints of a player depend on the rival players decisions. We present a globally convergent algorithm that is suited for the computation of a normalized Nash equilibrium in the generalized Nash game with jointly convex constraints. The main tool is the regularized Nikaido-Isoda function...

Multi-class pattern recognition has a wide range of applications including handwritten digit recognition (Chiang, 1998), speech tagging and recognition (Athanaselis, Bakamidis, Dologlou, Cowie, Douglas-Cowie & Cox, 2005), bioinformatics (Mahony, Benos, Smith & Golden, 2006) and text categorization (Massey, 2003). This chapter presents a comprehensive and competitive study in multi-class neural ...

The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoretical proof of this fact based on a refinement of the KušnirenkoBernštein theorem. We apply this result to the determination of the Newton polygon of a curve parameterized by generic Laurent polynomials or by generic r...

We study certain plane graphs, called Newton graphs, representing a special class of dynamical systems which are closely related to Newton’s iteration method for finding zeros of (rational) functions defined on the complex plane. These Newton graphs are defined in terms of nonvanishing angles between edges at the same vertex. We derive necessary and sufftcient conditions-of purely combinatorial...

This paper introduces the general framework, concepts, and procedures of anatomically informed basis functions (AIBF), a new method for the analysis of functional magnetic resonance imaging (fMRI) data. In contradistinction to existing voxel-based univariate or multivariate methods the approach described here can incorporate various forms of prior anatomical knowledge to specify sophisticated s...