Related papers: Linear projections and successive minima
Random projections are random linear maps, sampled from appropriate distributions, that approx- imately preserve certain geometrical invariants so that the approximation improves as the dimension of the space grows. The well-known…
Many recently proposed gradient projection algorithms with inertial extrapolation step for solving quasi-variational inequalities in Hilbert spaces are proven to be strongly convergent with no linear rate given when the cost operator is…
This article uses basic homological methods for evaluating examples of compactly supported cohomology groups of line bundles over projective curve.
The long-standing problem of minimal projections is addressed from a computational point of view. Techniques to determine bounds on the projection constants of univariate polynomial spaces are presented. The upper bound, produced by a…
This paper deals with the convex feasibility problem, where the feasible set is given as the intersection of a (possibly infinite) number of closed convex sets. We assume that each set is specified algebraically as a convex inequality,…
The great advances of learning-based approaches in image processing and computer vision are largely based on deeply nested networks that compose linear transfer functions with suitable non-linearities. Interestingly, the most frequently…
We calculate a projective space of essential measured laminations in a surface pair, which will be used in another paper to help describe spaces of "finite height laminations."
In applications of linear algebra including nuclear physics and structural dynamics, there is a need to deal with uncertainty in the matrices. We focus on matrices that depend on a set of parameters $\omega$ and we are interested in the…
The linearizability of differential equations was first considered by Lie for scalar second order semi-linear ordinary differential equations. Since then there has been considerable work done on the algebraic classification of linearizable…
For linear systems $Ax=b$ we develop iterative algorithms based on a sketch-and-project approach. By using judicious choices for the sketch, such as the history of residuals, we develop weighting strategies that enable short recursive…
A type of iterative orthogonally accumulated projection methods for solving linear system of equations are proposed in this paper. This type of methods are applications of accumulated projection(AP) technique proposed recently by authors.…
Using semi-tensor product of matrices, the structures of several kinds of symmetric games are investigated via the linear representation of symmetric group in the structure vector of games as its representation space. First of all, the…
Our interest is a regularity of a minimal singular metric of a line bundle. One main conclusion of our general result in this paper is the existence of continuous Hermitian metrics with semi-positive curvatures on the so-called Zariski's…
A new technique for approximating the entire solution set for a nonlinear system of relations (nonlinear equations, inequalities, etc. involving algebraic, smooth, or even continuous functions) is presented. The technique is to first plot…
The cut and project method is a central construction in the theory of Aperiodic Order for generating quasicrystals with pure point diffraction. Linear repetitivity ({\bf LR}) is a form of ideal regularity of aperiodic patterns. Recently,…
Simple constructions are given for finite semifields that include as special cases both old semifields and recently constructed semifields.
We develop an intersection theory for a singular hemitian line bundle with positive curvature current on a smooth projective variety and irreducible curves on the variety. And we prove the existence of a natural rational fibration structure…
In this paper we derive geometric consequences from the presence of a long strand of linear syzygies in the minimal free resolution of a closed scheme in projective space whose homogeneous ideal is generated by quadrics. These consequences…
A formula for the irregularity of abelian coverings of the projective plane is established and some applications are presented.
The Johnson-Lindenstrauss Lemma states that there exist linear maps that project a set of points of a vector space into a space of much lower dimension such that the Euclidean distance between these points is approximately preserved. This…