A direct method based on oblique projections is adapted to compute the stationary distribution vector of a finite Markov chain. The algorithm can also be used to compute the group inverse of the corresponding generator matrix. It is shown how to update the stationary vector and other quantities of interest when one row of the transition probability matrix is modified. A GTH-like variant that ap...

Dimension reduction is critical in many areas of data mining and machine learning. In this paper, a Covariance-preserving Projection Method (CPM for short) is proposed for dimension reduction. CPM maximizes the class discrimination and also preserves approximately the class covariance. The optimization involved in CPM can be formulated as low rank approximations of a collection of matrices, whi...

A new finite difference numerical method for modeling the interaction between flexible elastic membranes and an incompressible fluid in a two-dimensional domain is presented. The method differs from existing methods in the way the forces exerted by the membranes on the fluid are modeled. These are described by a collection of regularized point forces, and the velocity field they induce is compu...

In this paper a fully explicit, stabilized projection method called the Runge–Kutta–Chebyshev (RKC) projection method is presented for the solution of incompressible Navier–Stokes systems. This method preserves the extended stability property of the RKC method for solving ODEs, and it requires only one projection per step. An additional projection on the time derivative of the velocity is perfo...

Arizona Center for Mathematical Studies, University of Arizona Tucson, Arizona 85721 Institute of Physics, Slovak Academy of Sciences, 84228 Bratislava, Slovak Republic Supercomputer Computations Research Institute, Florida State University, Tallahassee, Florida 32306-4130 Center for Materials Research and Technology, Department of Physics, Florida State University, Tallahassee, Florida 32306-4350

This paper proposes several adjustments to the ISO 12233 slanted edge algorithm for estimating camera MTF. First, the Ridler-Calvard binary image segmentation method is used to find the line. Secondly, total least squares, rather than ordinary least squares, is used to compute the line parameters. Finally, the pixel values are projected in the reverse direction from the 1D array to the 2D image...

A new formulation of the immersed boundary method with a structure algebraically identical to the traditional fractional step method is presented for incompressible flow over bodies with prescribed surface motion. Like previous methods, a boundary force is applied at the immersed surface to satisfy the no-slip constraint. This extra constraint can be added to the incompressible Navier–Stokes eq...

The projection method obtains non-trivial point processes from higher dimensional Poisson point processes by constructing a random subset of the higher dimensional space and projecting the points of the Poisson process lying in that set onto the lower dimensional region. This paper presents a review of this method related to spatial point processes as well as some examples of its applications. ...

Keywords--Variat ional inequalities, Projection method, Fixed point, Convergence. 1. I N T R O D U C T I O N Variational inequalities.have had a great impact and influence in the development of almost all branches of pure and applied sciences. There are a substantial number of numerical methods including projection, the WieneroHopf equations, auxiliary principle techniques for solving variation...

Image projection is important for many applications in entertainment industry, augmented reality, and computer graphics. However, perceived distortion is often introduced by projection, which is a common problem of a projector system. Compensating such distortion for projection on non-trivial surfaces is often very challenging. In this paper, we propose a novel method to pre-warp the image such...