scientific article; zbMATH DE number 5168246
From MaRDI portal
Publication:3447170
Recommendations
- Low rank approximate solutions to large Sylvester matrix equations
- Implementation of fast low rank approximation of a Sylvester matrix
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
- An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
- Structured low rank approximation of non-negative matrices
- Structured low-rank approximation for nonlinear matrices
- A structured rank-revealing method for Sylvester matrix
- Structured low rank approximation
- Generalized low rank approximations of matrices
- Generalized low rank approximations of matrices
Cited in
(29)- Structured matrix methods computing the greatest common divisor of polynomials
- Toward the best algorithm for approximate GCD of univariate polynomials
- Structured low-rank approximation: optimization on matrix manifold approach
- Computing approximate greatest common right divisors of differential polynomials
- Variable projection methods for approximate (greatest) common divisor computations
- Structured low rank approximation of a Bezout matrix
- Structured total least norm and approximate GCDs of inexact polynomials
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach
- A quadratically convergent algorithm for structured low-rank approximation
- Structured matrix based methods for approximate polynomial GCD
- Approximate least common multiple of several polynomials using the ERES division algorithm
- Implementation of fast low rank approximation of a Sylvester matrix
- Approximate polynomial GCD.
- Regularization and matrix computation in numerical polynomial algebra
- A regularization approach for estimating the type of a plane curve singularity
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- The computation of multiple roots of a polynomial
- An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials
- Overdetermined Weierstrass iteration and the nearest consistent system
- The computation of multiple roots of a Bernstein basis polynomial
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
- A subdivision method for computing nearest gcd with certification
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
- Computationally efficient selection criterion of initial equation in STLN-based structured low-rank approximation
- Riemann-oracle: a general-purpose Riemannian optimizer to solve nearness problems in matrix theory
- Relaxed NewtonSLRA for approximate GCD
- Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3447170)
