This paper looks at the SSOR algorithm and shows that, under certain conditions, we can generate an approximation to the SSOR preconditioner using only one triangular solve. We show that this approximation can result in slightly increased iterations to convergence, but increased solution eeciency when used as a preconditioner for non-symmetric, indeenite systems of equations. The paper analyzes...

Many papers have discussed preconditioned block iterative methods for solving full rank least-squares problems. However very few papers studied iterative methods for solving rank-de cient least-squares problems. Miller and Neumann (1987) proposed the 4-block SOR method for solving the rank-de cient problem. Here a 2-block SOR method and a 3-block SOR method are proposed to solve such problem. T...

The matrix completion problem is to recover a low-rank matrix from a subset of its entries. The main solution strategy for this problem has been based on nuclear-norm minimization which requires computing singular value decompositions – a task that is increasingly costly as matrix sizes and ranks increase. To improve the capacity of solving large-scale problems, we propose a low-rank factorizat...

The zero-forcing (ZF) and minimum mean square error (MMSE) based detectors can approach optimal performance in the uplink of massive multiple-input multiple-output (MIMO) systems. However, they require inverting a matrix whose complexity is cubic relation to dimension. This lead high computational effort, especially MIMO To mitigate this, several iterative methods have been proposed literature....

Being a crucial aspect of fifth-generation (5G) mobile communications systems, massively multiple-input multiple-output (mMIMO) architectures are expected to help achieve the highest key performance indicators. However, huge numbers antennas used in such systems make it difficult determine inversion signal channel matrix relied upon by several detection methods, hence posing problem with accura...

Step-asynchronous successive overrelaxation updates the values contained in a single vector using the usual Gauß–Seidel-like weighted rule, but arbitrarily mixing old and new values, the only constraint being temporal coherence— you cannot use a value before it has been computed. We show that given a nonnegative real matrix A, a σ ≥ ρ(A) and a vector w > 0 such that Aw ≤ σw, every iteration of ...

We present a very robust and efficient scheme for 3-D reconstruction from point correspondences over multiple images taken by uncalibrated cameras. Our method is based on iterative projective reconstruction followed by Euclidean upgrading. We accelerate the time-consuming iterations for projective reconstruction by using the power method for eigenvalue computation, accelerating the power method...

A lateral boundary treatment using summation-by-parts operators and simultaneous approximation terms is introduced. The method is similar to Davies relaxation technique used in the weather prediction community and have similar areas of application, but is also provably stable. In this paper, it is shown how this technique can be applied to the shallow water equations, and that it reduces the er...

The LP relaxation for the Priority Steiner Tree is similar to the relaxation used before for the Steiner Tree. Again, say a set S ⊆ V crosses the set R if S ∩ R 6= ∅ and R \S 6= ∅ there is at least one terminal in S and one not in S. For j ≤ k, let Sj be the collection of all sets which cross Rj . Finally, for a set S ⊆ V , let ∂S be the set of edges with one endpoint in S and one in V \S. Defi...

Most discussion among players of the modern classical guitar regarding the early 19century guitar has been backward looking, that is, either looking at ways of playing this repertoire on a modern instrument in a modern style, or how to imitate the stylistic features of the period on a modern guitar. I will focus instead on coming towards Sor and his contemporaries from before their period, as c...