Related papers: Several Applications of Bezout Matrices
For applications like the numerical solution of physical equations a discretization scheme for operators is necessary. Recently frames have been used for such an operator representation. In this paper, we apply fusion frames for this task.…
We present module theory and linear maps as a powerful generalised and computationally efficient framework for the relational data model, which underpins today's relational database systems. Based on universal constructions of modules we…
Beginning with the projectively invariant method for linear programming, interior point methods have led to powerful algorithms for many difficult computing problems, in combinatorial optimization, logic, number theory and non-convex…
Frame theory provides a robust method for recovering vectors in a Hilbert space from inner product data, though the associated decomposition formula can be computationally demanding. We relax the frame condition by studying sequences that…
We present in this paper a comprehensive introduction to the algebraic Bethe Ansatz, taking as examples the six-vertex model with periodic and non-periodic boundary conditions. We propose a diagrammatic representation of the commutation…
We present an ongoing effort to implement Universal Algebra in the UniMath system. Our aim is to develop a general framework for formalizing and studying Universal Algebra in a proof assistant. By constituting a formal system for isolating…
Copi, Huterer, Starkman and Schwarz introduced multipole vectors in a tensor context and used them to demonstrate that the first-year WMAP quadrupole and octopole planes align at roughly the 99.9% confidence level. In the present article…
A novel algorithm for creating a mathematical model of curved shapes is introduced. The core of the algorithm is based on building a graph representation of the contoured image, which occupies less storage space than produced by raster…
The aim of this paper is to study some aspects of matrix theory through Pasting and Reversing. We start giving a summary of previous results concerning to Pasting and Reversing over vectors and matrices, after we rewrite such properties of…
This book, in order to generalize the two models of fuzzy cognitive maps and neutrosophic cognitive maps, has systematically invented mathematical tools like bimatrices, trimatrices, n-matrices, bigraphs, trigraphs and n-graphs and describe…
The construction of finite tight Gabor frames plays an important role in many applications. These applications include significant ones in signal and image processing. We explore when constant amplitude zero autocorrelation (CAZAC)…
We present matrices as graded BiHom-algebras and consider various characteristics of their decompositions. Specifically, we introduce a notion of connection in the support of the grading and use it to construct a family of canonical graded…
This report presents a brief review of matrix algebra and its implementation in Julia for power and energy applications. First, we present basic examples of data visualization, followed by conventional operations with matrices and vectors.…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
Quasi-separable matrices are a class of rank-structured matriceswidely used in numerical linear algebra and of growing interestin computer algebra, with applications in e.g. the linearization ofpolynomial matrices. Various representation…
Analytic perturbation theory for matrices and operators is an immensely useful mathematical technique. Most elementary introductions to this method have their background in the physics literature, and quantum mechanics in particular. In…
Tabular foundation models aim to learn universal representations of tabular data that transfer across tasks and domains, enabling applications such as table retrieval, semantic search and table-based prediction. Despite the growing number…
A generalization of the Vandermonde matrices which arise when the power basis is replaced by the Said-Ball basis is considered. When the nodes are inside the interval (0,1), then those matrices are strictly totally positive. An algorithm…
Kinematics of rigid bodies can be analyzed in many different ways. The advantage of using Euler parameters is that the resulting equations are polynomials and hence computational algebra, in particular Gr\"obner bases, can be used to study…