Computational problems for vector-valued quadratic forms

Details Computational problems for vector-valued quadratic forms Computational problems for vector-valued quadratic forms

2002-04-05

arxiv.org/abs/math/0204068v1

Mathematics

Algebraic Geometry

6 pages, no figures, submitted to Workshop on Open Problems in Mathematical Systems and Control Theory

Scientific paper

Given two real vector spaces $U$ and $V$, and a symmetric bilinear map $B: U\times U\to V$, let $Q_B$ be its associated quadratic map $Q_B$. The problems we consider are as follows: (i) are there necessary and sufficient conditions, checkable in polynomial-time, for determining when $Q_B$ is surjective?; (ii) if $Q_B$ is surjective, given $v\in V$ is there a polynomial-time algorithm for finding a point $u\in Q_B^{-1}(v)$?; (iii) are there necessary and sufficient conditions, checkable in polynomial-time, for determining when $B$ is indefinite? We present an alternative formulation of the problem of determining the image of a vector-valued quadratic form in terms of the unprojectivised Veronese surface. The relation of these questions with several interesting problems in Control Theory is illustrated.

Affiliated with

Also associated with

No associations

Rating

Computational problems for vector-valued quadratic forms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computational problems for vector-valued quadratic forms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational problems for vector-valued quadratic forms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-553215