Pages that link to "Item:Q2643537"

The following pages link to Parallel computation of determinants of matrices with polynomial entries (Q2643537):

Displaying 19 items.

• A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic (Q285264) (← links)
• An effective algorithm of computing symbolic determinants with multivariate polynomial entries (Q990537) (← links)
• An effective hybrid algorithm for computing symbolic determinants (Q1044418) (← links)
• Multipolynomial resultant algorithms (Q1260754) (← links)
• Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems (Q1372035) (← links)
• Computing the determinant of a matrix with polynomial entries by approximation (Q1621164) (← links)
• Data parallel evaluation-interpolation algorithm for polynomial matrix inversion (Q1801378) (← links)
• Massively parallel computations on many-variable polynomials (Q1817071) (← links)
• Obtaining exact interpolation multivariate polynomial by approximation (Q1937782) (← links)
• Validated numerical computation of the \(\mathcal L_{\infty}\)-norm for linear dynamical systems (Q2457358) (← links)
• Computing the intersection of two ruled surfaces by using a new algebraic approach (Q2457394) (← links)
• The division free parallel algorithm for finding determinant (Q2863776) (← links)
• Complexity of constructing Dixon resultant matrix (Q3174885) (← links)
• (Q3362968) (← links)
• (Q3643746) (← links)
• Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices (Q4326853) (← links)
• Fast parallel algorithms for vandermonde determinants (Q4950623) (← links)
• COMPUTATION OF A DETERMINANT AND A MATRIX PRODUCT IN CELLULAR AUTOMATA (Q5151295) (← links)
• Two-dimensional symmetric and antisymmetric generalizations of exponential and cosine functions (Q5246566) (← links)