Related papers: Several Applications of Bezout Matrices
We assume that every element of a matrix has a small, individual error, and model it by an external number, which is the sum of a nonstandard real number and a neutrix, the latter being a convex (external) set having the group property. The…
In this paper we study generic M(atrix) theory compactifications that are specified by a set of quotient conditions. A procedure is proposed, which both associates an algebra to each compactification and leads deductively to general…
Versal deformation of a matrix A is a normal form to which all matrices A + E, close to A, can be reduced by similarity transformation smoothly depending on the entries of A + E. In this paper we discuss versal deformations and their use in…
Many statistical models are algebraic in that they are defined by polynomial constraints or by parameterizations that are polynomial or rational maps. This opens the door for tools from computational algebraic geometry. These tools can be…
Elimination theory has many applications, in particular, it describes explicitly an image of a complex line under rational transformation and determines the number of common zeroes of two polynomials in one variable. We generalize classical…
In this paper, we use the blending functions of Bernstein polynomials with shifted knots for construction of Bezier curves and surfaces. We study the nature of degree elevation and degree reduction for Bezier Bernstein functions with…
We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.
Bayesian analysis of functions and curves is considered, where warping and other geometrical transformations are often required for meaningful comparisons. We focus on two applications involving the classification of mouse vertebrae shape…
In recent years, various notions of algebraic independence have emerged as a central and unifying theme in a number of areas of applied mathematics, including algebraic statistics and the rigidity theory of bar-and-joint frameworks. In each…
Answering connectivity queries in real algebraic sets is a fundamental problem in effective real algebraic geometry that finds many applications in e.g. robotics where motion planning issues are topical. This computational problem is…
A new approach is established to computing the image of a rational map, whereby the use of approximation complexes is complemented with a detailed analysis of the torsion of the symmetric algebra in certain degrees. In the case the map is…
We provide a novel tool which may be used to construct new examples of positive maps in matrix algebras (or, equivalently, entanglement witnesses). It turns out that this can be used to prove positivity of several well known maps (such as…
Numerical nonlinear algebra is a computational paradigm that uses numerical analysis to study polynomial equations. Its origins were methods to solve systems of polynomial equations based on the classical theorem of B\'ezout. This was…
Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…
We introduce a new formalism and a number of new results in the context of geometric computational vision. The classical scope of the research in geometric computer vision is essentially limited to static configurations of points and lines…
Complex analysis is a powerful tool to study classical integrable systems, statistical physics on the random lattice, random matrix theory, topological string theory,... All these topics share certain relations, called "loop equations" or…
Fusion frames are a very active area of research today because of their myriad of applications in pure mathematics, applied mathematics, engineering, medicine, signal and image processing and much more. They provide a great flexibility for…
The various non-linear transformations incurred by the rays in an optical system can be modelled by matrix products up to any desired order of approximation. Mathematica software has been used to find the appropriate matrix coefficients for…
For any given Feynman graph, the set of integrals with all possible powers of the propagators spans a vector space of finite dimension. We introduce the package {\sc Azurite} ({\bf A ZUR}ich-bred method for finding master {\bf I}n{\bf…
Inverse Vandermonde matrix calculation is a long-standing problem to solve nonsingular linear system $Vc=b$ where the rows of a square matrix $V$ are constructed by progression of the power polynomials. It has many applications in…