Pages that link to "Item:Q5355581"
From MaRDI portal
The following pages link to <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials (Q5355581):
Displayed 8 items.
- The calculation of the degree of an approximate greatest common divisor of two polynomials (Q611832) (← links)
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix (Q989131) (← links)
- Obtaining exact value by approximate computations (Q2464301) (← links)
- A structured rank-revealing method for Sylvester matrix (Q2469622) (← links)
- Structured total least norm and approximate GCDs of inexact polynomials (Q2480912) (← links)
- Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials (Q3587712) (← links)
- On rank and null space computation of the generalized Sylvester matrix (Q5962121) (← links)