We design new sketching algorithms for unitarily invariant matrix norms, including the Schatten p-norms ‖·‖Sp , and obtain, as a by-product, streaming algorithms that approximate the norm of a matrix A presented as a turnstile data stream. The primary advantage of our streaming algorithms is that they are simpler and faster than previous algorithms, while requiring the same or less storage. Our...

It is the new, multi-disciplinary journal that has already gained more than 1,000 institutional subscribers across six continents! It has clearly captured the interest of researchers in a wide range of disciplines and from around the world. Moreover, it represents not only an opportunity for you to be a part of this groundbreaking journal, but also to showcase your important findings to the world.

A random matrix is likely to be well conditioned, and motivated by this well known property we employ random matrix multipliers to advance some fundamental matrix computations. This includes numerical stabilization of Gaussian elimination with no pivoting as well as block Gaussian elimination, approximation of the leading and trailing singular spaces of an ill conditioned matrix, associated wit...

Urokinase plasminogen activator (uPA) and its receptor (uPAR) coordinate a plasmin-mediated proteolytic cascade that has been implicated in cell adhesion, cell motility, and matrix breakdown, for example, during inflammation. As part of their function during inflammatory responses, macrophages move through tissues and encounter both two-dimensional (2D) surfaces and more complex three-dimension...

background: successful waste management programs are linked to internal factors, sw (strength and weakness points), and external factors, ot (opportunities and threats), and at the macro level are grounds for sustainable development. studies may be related to david’s study which presented a method to quantify strength, weakness, opportunity, threats (swot) analysis. methods: in this study, desi...

This work considers the matrix differential equation Y Y s A t Y , 1.1 Ž . Ž . Ž . where A t is a hermitian, n = n matrix function, invertible and analytic Ž . on a, ` . For the analogous scalar equation, y s a t y , 1.2 Ž . Ž . Ž . there exists under suitable assumptions the Liouville]Green L-G, WKB y1r4 Ž 1r2 . approximation y f a exp "Ha . Improvements to the L-G approxiw x mations were soug...

The problem of estimating mean and covariances of a multivariate normally distributed random vector has been studied in many forms. This paper focuses on the estimators proposed by Ohlson et al. (2011) for a banded covariance structure with m-dependence. We rewrite the estimator when m = 1, which makes it easier to analyze. This leads to an adjustment, and an unbiased estimator can be proposed....

In this paper, we describe and analyse several block matrix iterative algorithms for solving a saddle point linear system arising from the discretization of a linear-quadratic elliptic control problem with Neumann boundary conditions. To ensure that the problem is well posed, a regularization term with a parameter is included. The first algorithm reduces the saddle point system to a symmetric p...