New Fast Algorithms for Structured Linear Least Squares Problems
From MaRDI portal
Recommendations
Cited in
(12)- scientific article; zbMATH DE number 2151323 (Why is no real title available?)
- A fast algorithm for solving a two-parameter least squares problem
- scientific article; zbMATH DE number 1617949 (Why is no real title available?)
- Schur-Type Methods for Solving Least Squares Problems with Toeplitz Structure
- A fast algorithm for solving the Sylvester structured total least squares problem
- A unified least squares approach to identify and to reduce continuous asymptotically stable systems
- A least squares approach to reduce stable discrete linear systems preserving their stability.
- A superfast method for solving Toeplitz linear least squares problems.
- Fast algorithm for solving the Hankel/Toeplitz structured total least squares problem
- High-performance numerical algorithms and software for structured total least squares
- Fast Solution of Toeplitz‐ and Cauchy‐Like Least‐Squares Problems
- Simple backward error bounds for linear least-squares problems
This page was built for publication: New Fast Algorithms for Structured Linear Least Squares Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243503)