Approximation of multilevel Toeplitz matrices via multilevel trigonometric matrix spaces and applications to preconditioning
The results presented in this paper appear to serve as an unifying tool for dealing with the preconditioning problem for large dimensions, by devising preconditioners in any multilevel trigonometric linear space of matrices. Some clustering properties of the preconditioned matrices are proved which allow one to solve efficiently, by means of the preconditioned conjugate gradient type algorithms, linear systems or least squares problems. Some numerical results are reported.
- A Korovkin-Based Approximation of MultilevelToeplitz Matrices (With Rectangular Unstructured Blocks) via Multilevel Trigonometric Matrix Spaces
- Two-level Toeplitz preconditioning: approximation results for matrices and functions
- Matrix algebra preconditioners for multilevel Toeplitz systems do not insure optimal convergence rate
- scientific article; zbMATH DE number 1126864
- Toeplitz Preconditioners Constructed from Linear Approximation Processes
- Some theorems on linear positive operators and functionals and their applications
- Optimal trigonometric preconditioners for nonsymmetric Toeplitz systems
- Preconditioning strategies for non‐Hermitian Toeplitz linear systems
- Two‐grid methods for banded linear systems from DCT III algebra
- A Korovkin-Based Approximation of MultilevelToeplitz Matrices (With Rectangular Unstructured Blocks) via Multilevel Trigonometric Matrix Spaces
- Korovkin tests, approximation, and ergodic theory
- Optimal multilevel matrix algebra operators
This page was built for publication: Approximation of multilevel Toeplitz matrices via multilevel trigonometric matrix spaces and applications to preconditioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964030)