Fundamentals of matrix computations

TL;DR: In this article, an inverse power method is examined for calculation of the effective multiplication factor in neutron transport problems, and it is shown that the method can be extended to multigroup multidimensional problems.

TL;DR: An options discovery algorithm is proposed and is the first of its kind to be applicable in continuous state spaces and has running time O(mn2) rather than O(n3) making it suitable to much larger domains than the typical grid worlds.

TL;DR: In this article, an optimization technique based on the nonconventional least squares approximation to the direction-of-arrival (DOA) estimation problem is presented. But, unlike the conventional least squares problem, where the number of unknowns is much greater than number of equations and hence it is a very underdetermined problem, this technique is ideally suited for deployment in a complex environment and the entire computation can be done in real time.

TL;DR: A novel algorithm (CERN) is proposed which uses a special form of combinatorial search to optimise groups of neural nodes to achieve significantly better accuracy with fewer nodes than spherical basis nodes optimised by k-means clustering.