Results 221 to 230 of about 1,823 (264)

Sums of squares, moment matrices and optimization over polynomials.

Laurent, M.
core  

On the Computation of Tensor Functions under Tensor‐Tensor Multiplications with Linear Maps

Numerical Linear Algebra with Applications, Volume 33, Issue 3, June 2026.
ABSTRACT In this paper, we study the computation of both algebraic and non‐algebraic tensor functions under the tensor‐tensor multiplication with linear maps. In the case of algebraic tensor functions, we prove that the asymptotic exponent of both the tensor‐tensor multiplication and the tensor polynomial evaluation problem under this multiplication is
Jeong‐Hoon Ju, Susana López‐Moreno
wiley   +1 more source

Bounds on special subsets in graphs, eigenvalues and association schemes.

Dam, E.R. van
core  

The spectral excess theorem for distance-regular graphs: A global (over)view.

Dam, E.R. van
core  

On almost distance-regular graphs.

Fiol, M.A., Dalfo, C., Gorissen, B.L., Garriga, E., Dam, E.R. van   +4 more
core  

Some of the next articles are maybe not open access.

Related searches:

Polynomial algorithms for linear programming over the algebraic numbers

Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92, 1992
Linear 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, 2022
zbMATH 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, 2021
We 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

The algebra of linear functionals on polynomials, with applications to Padé approximation

Numerical Algorithms, 1996
This 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 algebraic approach for computing polynomial resultant

1982
This 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, Attilio Colagrossi, Alfonso Miola   +2 more
openaire   +1 more source