Related papers: Projective Root-Locus: An Extension of Root-Locus …
In this paper we show how to split the Root Locus plot for an irreducible rational transfer function into several individual algebraic plane curves, like lines, circles, conics, etc. To achieve this goal we use results of a previous paper…
A standard procedure in classical projective geometry, using pencils of lines to extend an incidence plane to a projective plane, is examined from a constructive viewpoint. Brouwerian counterexamples reveal the limitations of traditional…
We revisit the coordinatisation method for projective planes. First, we discuss how the behaviour of the additive and multiplicative loops can be described in terms of its action on the "vertical" line, and how this means one can…
This paper is devoted to the investigation of selected situations when the computation of projective (and other) equivalences of algebraic varieties can be efficiently solved with the help of finding projective equivalences of finite sets…
This article provides a new perspective on the geometry of a projective line, which helps clarify and illuminate some classical results about projective plane. As part of the same train of ideas, the article also provides a proof of the…
In classical geometric algebra, there have been several treatments of affine and projective planes based on fields. In this thesis we approach affine and projective planes from a constructive point of view and we base our geometry on local…
In this note, we provide explicit expressions for the projections onto the graph of a quadratic polynomial. The projections are obtained by examining the critical points of the associated quartic polynomial, that is, the roots of the cubic…
By recasting metrical geometry in a purely algebraic setting, both Euclidean and non-Euclidean geometries can be studied over a general field with an arbitrary quadratic form. Both an affine and a projective version of this new theory are…
We address the problem of projecting a point onto a quadratic hypersurface, more specifically a central quadric. We show how this problem reduces to finding a given root of a scalar-valued nonlinear function. We completely characterize one…
Polyhedral projection is a main operation of the polyhedron abstract domain.It can be computed via parametric linear programming (PLP), which is more efficient than the classic Fourier-Motzkin elimination method.In prior work, PLP was done…
We extend Jordan's notion of principal angles to work for two subspaces of quaternionic space, and so have a method to analyze two orthogonal projections in M_n(A) for A the real, complex or quaternionic field (or skew field). From this we…
There exist efficient algorithms to project a point onto the intersection of a convex cone and an affine subspace. Those conic projections are in turn the work-horse of a range of algorithms in conic optimization, having a variety of…
The projection onto the epigraph or a level set of a closed proper convex function can be achieved by finding a root of a scalar equation that involves the proximal operator as a function of the proximal parameter. This paper develops the…
A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties, projective subplanes, configuration counts, a partial…
Random projections (RP) are a popular tool for reducing dimensionality while preserving local geometry. In many applications the data set to be projected is given to us in advance, yet the current RP techniques do not make use of…
This paper is devoted to the study of a newly introduced tool, projectional coderivatives and the corresponding calculus rules in finite dimensions. We show that when the restricted set has some nice properties, more specifically, is a…
To address functional-output regression, we introduce projection learning (PL), a novel dictionary-based approach that learns to predict a function that is expanded on a dictionary while minimizing an empirical risk based on a functional…
This paper considers a conceptual version of a convex optimization algorithm whic is based on replacing a convex optimization problem with the root-finding problem for the approximate sub-differential mapping which is solved by repeated…
Let A be an affine algebra over the field of real numbers of dimension d. Let f \in A be an element not belonging to any real maximal ideal of A. Let P be a projective A-module of rank \geq d-1. Let (a,p) \in A_f \oplus P_f be a unimodular…
In this text, we explore the tools that Projective Differential Geometry can provide for the asymptotic analysis of classical fields on projectively compact manifolds. We emphasise on the case of order 2-compactifications and develop, in…