scientific article; zbMATH DE number 2151323
From MaRDI portal
Publication:4660801
zbMATH Open1066.65046MaRDI QIDQ4660801
Publication date: 4 April 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityfast algorithmsLevinson algorithmToeplitz matrixSchur algorithmleast squares problemsMoore-Penrose pseudoinverseQR-factorizationToeplitz matrix inversion
Related Items (9)
A fast algorithm for linear least-squares smoothing and boundary value problems using number-theoretic transforms ⋮ A fast algorithm for solving regularized total least squares problems ⋮ Fast iterative methods for solving Toeplitz-plus-Hankel least squares problems ⋮ A fast Kaczmarz-Kovarik algorithm for consistent least-squares problems ⋮ Unnamed Item ⋮ Fast least squares approximation using tensor products of functions and linear forms ⋮ Unnamed Item ⋮ A fast algorithm for solving the Sylvester structured total least squares problem ⋮ Comparison of algorithms for Toeplitz least squares and symmetric positive definite linear systems
This page was built for publication:
