Structured low-rank approximation for nonlinear matrices
From MaRDI portal
Publication:6109889
DOI10.1007/s11075-022-01479-5OpenAlexW4311778454MaRDI QIDQ6109889
Publication date: 31 July 2023
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-022-01479-5
structured low-rank approximationstructured matrix perturbationnonlinearly structured matricesapproximate common factors computation
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Approximation with constraints (41A29) Numerical analysis (65-XX)
Cites Work
- Unnamed Item
- Unnamed Item
- Adjusted least squares fitting of algebraic hypersurfaces
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- A nonlinear generalization of singular value decomposition and its applications to mathematical modeling and chaotic cryptanalysis
- On the conic section fitting problem
- A subspace method for the computation of the GCD of polynomials
- Low-rank approximation. Algorithms, implementation, applications
- Computation of approximate polynomial GCDs and an extension
- Structured low rank approximation
- Consistent least squares fitting of ellipsoids
- Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control
- A gradient system approach for Hankel structured low-rank approximation
- Variable projection for affinely structured low-rank approximation in weighted \(2\)-norms
- Variable projection methods for approximate (greatest) common divisor computations
- An ODE-based method for computing the approximate greatest common divisor of polynomials
- Derivatives of Eigenvalues and Eigenvectors of Matrix Functions
- Exact and Approximate Modeling of Linear Systems
- Nonlinearly Structured Low-Rank Approximation
- Structured Total Least Norm for Nonlinear Problems
- The approximate GCD of inexact polynomials
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
This page was built for publication: Structured low-rank approximation for nonlinear matrices