Pages that link to "Item:Q5578437"
From MaRDI portal
The following pages link to Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination (Q5578437):
Displaying 33 items.
- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations (Q2802247) (← links)
- Computing Characteristic Polynomials of Matrices of Structured Polynomials (Q2830011) (← links)
- Solve linear system with Sylvester's condensation (Q2901444) (← links)
- Book Review: The Chinese roots of linear algebra (Q2949105) (← links)
- Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation (Q3009769) (← links)
- Algorithme de Bareiss, algorithme des sous-résultants (Q3124402) (← links)
- (Q3165156) (← links)
- Spécialisation de la suite de Sturm et sous-résultants (I) (Q3358238) (← links)
- Lazy and Forgetful Polynomial Arithmetic and Applications (Q3644102) (← links)
- A Table of Quintic Number Fields (Q4305961) (← links)
- On One Type of Generalized Vandermonde Determinants (Q4577054) (← links)
- (Q4637752) (← links)
- An algorithm to calculate generalized Seifert matrices (Q5050615) (← links)
- Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations (Q5071429) (← links)
- Additive primitive length in relatively free algebras (Q5225768) (← links)
- Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work (Q5232110) (← links)
- Rank Vertex Cover as a Natural Problem for Algebraic Compression (Q5232153) (← links)
- Computing characteristic polynomials of matrices of structured polynomials (Q5268829) (← links)
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates (Q5358295) (← links)
- Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations (Q5641964) (← links)
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization (Q5883713) (← links)
- Planar and Toroidal Morphs Made Easier (Q5886038) (← links)
- Efficient algorithms for computing the characteristic polynomial in a domain (Q5928850) (← links)
- A generalized Sylvester identity and fraction-free random Gaussian elimination (Q5933502) (← links)
- Algebraic number fields and the LLL algorithm (Q6051125) (← links)
- The computational complexity of knot genus in a fixed 3‐manifold (Q6075064) (← links)
- Methodologies of Symbolic Computation (Q6163846) (← links)
- Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond (Q6172035) (← links)
- Continued fraction expansions of Herglotz–Nevanlinna functions and generalized indefinite strings of Stieltjes type (Q6175440) (← links)
- Exact QR factorizations of rectangular matrices (Q6204198) (← links)
- Clausal proofs for pseudo-Boolean reasoning (Q6535573) (← links)
- Maximum energy dissipation-based incremental approach for structural analyses involving discrete fracture propagation in quasi-brittle materials (Q6609775) (← links)
- Interpolation by decomposable univariate polynomials (Q6614422) (← links)
