On the robustness of numerical algorithms for linear systems and signal processing in finite precision arithmetic
From MaRDI portal
Publication:2792853
DOI10.1002/acs.2562zbMath1332.93244OpenAlexW1569279781MaRDI QIDQ2792853
Publication date: 14 March 2016
Published in: International Journal of Adaptive Control and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/acs.2562
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conjugate gradient and steepest descent constant modulus algorithms applied to a blind adaptive array
- Input-output-to-state stability for discrete-time systems
- Input-to-state stability for discrete-time time-varying systems with applications to robust stabilization of systems in power form
- System theory for numerical analysis
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- Multivariable feedback design: Concepts for a classical/modern synthesis
- The necessity of the small-gain theorem for time-varying and nonlinear systems
- Stability of Conjugate Gradient and Lanczos Methods for Linear Least Squares Problems
- Input-to-state dynamical stability and its Lyapunov function characterization
- A simplified small gain theorem for time-varying nonlinear systems
- A Control-Theoretic Approach to the Design of Zero Finding Numerical Methods
- Control Perspectives on Numerical Algorithms and Matrix Problems
- A conceptual framework for consistency, conditioning, and stability issues in signal processing
- Convergence in Backward Error of Relaxed GMRES
- Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
- An Algorithm for Linear Inequalities and its Applications
This page was built for publication: On the robustness of numerical algorithms for linear systems and signal processing in finite precision arithmetic
