Pages that link to "Item:Q3984475"
From MaRDI portal
The following pages link to <i>s</i>-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems (Q3984475):
Displaying 30 items.
- The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR (Q327002) (← links)
- A generalization of \(s\)-step variants of gradient methods (Q415206) (← links)
- Parallel iterative S-step methods for unsymmetric linear systems (Q671295) (← links)
- s-step iterative methods for symmetric linear systems (Q1118971) (← links)
- The stable \(A^TA\)-orthogonal \(s\)-step orthomin\((k)\) algorithm with the CADNA library (Q1127056) (← links)
- On the squared unsymmetric Lanczos method (Q1347170) (← links)
- Some recursions on Arnoldi's method and IOM for large non-Hermitian linear systems (Q1570132) (← links)
- An efficient algorithm based on Lanczos type of BCR to solve constrained quadratic inverse eigenvalue problems (Q1624659) (← links)
- Varying the \(s\) in your \(s\)-step GMRES (Q1744315) (← links)
- Periodic conjugate direction algorithm for symmetric periodic solutions of general coupled periodic matrix equations (Q2001295) (← links)
- Developing Kaczmarz method for solving Sylvester matrix equations (Q2094980) (← links)
- Conjugate gradient-like methods for solving general tensor equation with Einstein product (Q2181341) (← links)
- Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides (Q2202979) (← links)
- Solving constrained quadratic inverse eigenvalue problem via conjugate direction method (Q2203009) (← links)
- Conjugate gradient-like algorithms for constrained operator equation related to quadratic inverse eigenvalue problems (Q2244950) (← links)
- Least squares solutions of quadratic inverse eigenvalue problem with partially bisymmetric matrices under prescribed submatrix constraints (Q2293566) (← links)
- Computing symmetric solutions of general Sylvester matrix equations via Lanczos version of biconjugate residual algorithm (Q2334882) (← links)
- Block s-step Krylov iterative methods (Q3090777) (← links)
- A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems (Q3462304) (← links)
- On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems (Q4220444) (← links)
- A block varaint of the GMRES method for unsymmetric linear systems (Q4229576) (← links)
- Biconjugate residual algorithm for solving general Sylvester-transpose matrix equations (Q5088135) (← links)
- An EM-based iterative method for solving large sparse linear systems (Q5205779) (← links)
- Scalable Linear Solvers Based on Enlarged Krylov Subspaces with Dynamic Reduction of Search Directions (Q5240796) (← links)
- Tensor Bi-CR Methods for Solutions of High Order Tensor Equation Accompanied by Einstein Product (Q5864760) (← links)
- A robust meta-heuristic adaptive Bi-CGSTAB algorithm to online estimation of a three DoF state–space model in the presence of disturbance and uncertainty (Q5867067) (← links)
- Modified block product preconditioner for a class of complex symmetric linear systems (Q6104966) (← links)
- BCR algorithm for solving quadratic inverse eigenvalue problems for partially bisymmetric matrices (Q6563382) (← links)
- Developing variable \(s\)-step CGNE and CGNR algorithms for non-symmetric linear systems (Q6601163) (← links)
- A numerically stable communication-avoiding \(s\)-step GMRES algorithm (Q6641763) (← links)