Results 231 to 240 of about 2,093 (267)
Some of the next articles are maybe not open access.
Polynomial algorithms for linear programming over the algebraic numbers
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92, 1992Linear programming (LP) is the problem of maximizing \(cx\) \((c\), a fixed \(n\)-vector), subject to \(Ax \Leftarrow b\) \((A\), a fixed \(m\) by \(n\) matrix and \(b\) a fixed \(m\)-vector). The dimension of a problem instance is the total number of entries in the vectors and matrices that define the instance (above: \(mn + n + m)\).
Ilan Adler, Peter A. Beling
openaire +2 more sources
A linear-algebraic method to compute polynomial PDE conservation laws
Journal of Symbolic Computation, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boreale, M, Collodi, L
openaire +2 more sources
Position–momentum decomposition of linear operators defined on algebras of polynomials
Journal of Mathematical Physics, 2021We present first a set of commutator relationships involving the joint quantum, semi-quantum, and number operators generated by a finite family of random variables, having finite moments of all orders, and show how these commutators can be used to recover the joint quantum operators from the semi-quantum operators.
A. I. Stan, G. Popa, R. Dutta
openaire +1 more source
Linear algebraic approach for computing polynomial resultant
1982This paper presents a linear algebraic method for computing the re sultant of two polynomials. This method is based on the computation of a determinant of order equal to the minimum of the degrees of the two giv en polynomials. This method turns out to be preferable to other known linear algebraic methods both from a computational point of view and for
Luciana Bordoni +2 more
openaire +1 more source
The algebra of linear functionals on polynomials, with applications to Padé approximation
Numerical Algorithms, 1996This paper is an interesting and complete study of the algebra of linear functionals on the vector space of complex polynomials. The results obtained have application to Padé and Padé-type approximants and lead to a different procedure for increasing the order of approximations, as well as to a new formula for the relative error.
Claude Brezinski, Pascal Maroni
openaire +1 more source
Linear operators with invariant polynomial space and graded algebra
Journal of Mathematical Physics, 1997The irreducible, finite-dimensional representations of the graded algebras osp(j,2) (j=1,2,3) are expressed in terms of differential operators. Some quantum deformations of these algebras are shown to admit similar kinds of representations. These are formulated in terms of finite difference operators.
Brihaye, Y. +2 more
openaire +2 more sources
Solution of an Equation in a Linear Algebra by Means of the Minimal Polynomial
Mathematics Magazine, 1969where A is an element (e.g., a matrix) which generates a finite dimensional linear algebra C [A] over the complex number field C. To do this we shall need certain ideas and results from linear algebra; these are presented in Section 2. In succeeding sections the main results of the paper are derived which lead to the principal theorem of the paper.
John C. Kieffer, F. Max Stein
openaire +1 more source
Polynomial IOPs for Linear Algebra Relations
2022Alan Szepieniec, Yuncong Zhang
openaire +1 more source
The Hilbert polynomial and linear forms in the logarithms of algebraic numbers
Izvestiya: Mathematics, 2008We prove a new estimate for homogeneous linear forms with integer coefficients in the logarithms of algebraic numbers. We obtain a qualitative improvement of the estimate depending on the coefficients of the linear form and the best value of the constant in the estimate in the case when the number of logarithms is not too large.
openaire +1 more source