Efficient implementation of a structured total least squares based speech compression method

DOI10.1016/S0024-3795(02)00465-2zbMath1020.94506MaRDI QIDQ1874673

Philippe Lemmerling, Nicola Mastronardi, Sabine Van Huffel

Publication date: 25 May 2003

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

displacement rankgeneralized Schur algorithmspeech compressioncomplex damped exponentials

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Iterative numerical methods for linear systems (65F10) General topics in the theory of algorithms (68W01)

Related Items (6)

Implicit iterative algorithm for solving regularized total least squares problems ⋮ On condition numbers of the total least squares problem with linear equality constraint ⋮ Stochastic algorithms for solving structured low-rank matrix approximation problems ⋮ Optimization challenges in the structured low rank approximation problem ⋮ The revisited total least squares problems with linear equality constraint ⋮ Multidimensional Total Least Squares Problem with Linear Equality Constraints

Uses Software

• LAPACK
• DGGLSE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weak and strong stability of algorithms in numerical linear algebra
• Generalized QR factorization and its applications
• Self-scaling fast rotations for stiff and equality-constrained linear least squares problems
• Fast Structured Total Least Squares Algorithm for Solving the Basic Deconvolution Problem
• Stability Issues in the Factorization of Structured Matrices
• Stabilizing the Generalized Schur Algorithm
• A Note on Downdating the Cholesky Factorization
• Displacement Structure: Theory and Applications
• Total Least Norm Formulation and Solution for Structured Problems

This page was built for publication: Efficient implementation of a structured total least squares based speech compression method