Superfast iterative solvers for linear matrix equations
From MaRDI portal
The article offers a new multistep decomposition method for constructing a superfast algorithm for solving a large system of linear equations. The approach used for the analysis of the iterative solvers (on the basis of adaptive control theory methods) is explored and exposed. For the decomposition steps \(S = 1,2,3\), explicit formulas for the matrix \(K\) in the feedback control law \(u_k = Kx_k\) are given. An interesting example for synthesizing a superfast iterative solver is also considered.
Recommendations
- Synthesis of fast and superfast solvers of large systems of linear algebraic equations using control theory methods
- Iterative methods for solving linear matrix equation and linear matrix system
- Optimal control of iterative solution methods for linear systems of equations
- An iterative algorithm for solving sparse linear equations
- Cyclic and simultaneous iterative methods to matrix equations of the form \(A_iXB_i=F_i\)
Cites work
- A PI stepsize control for the numerical solution of ordinary differential equations
- Control and stabilization of linear equation solvers
- Control Perspectives on Numerical Algorithms and Matrix Problems
- Control theoretic techniques for stepsize selection in explicit Runge-Kutta methods
- Controllability of matrix eigenvalue algorithms: the inverse power method
- Introduction to the mathematical theory of control processes. Vol. II:Nonlinear processes
- On controllability of the real shifted inverse power iteration
- Optimal control of iterative solution methods for linear systems of equations
- Superstable linear control systems. I: Analysis
- System theory for numerical analysis
- The Tortoise and the Hare Restart GMRES
Cited in
(6)- Optimal design of optical analog solvers of linear systems
- Synthesis of fast and superfast solvers of large systems of linear algebraic equations using control theory methods
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- Fast Multiresolution Algorithms for Solving Linear Equations: A Comparative Study
- Method for preconditioning matrix equations based on zero divisors
This page was built for publication: Superfast iterative solvers for linear matrix equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709851)