A Generalization of the Conjugate-Gradient Method to Solve Complex Systems
From MaRDI portal
Cited in
(18)- Real valued iterative methods for solving complex symmetric linear systems
- A structure preserving difference scheme with fast algorithms for high dimensional nonlinear space-fractional Schrödinger equations
- CSSg method for several genericities of parametric systems
- Exact solutions and convergence of gradient based dynamical systems for computing outer inverses
- The CBiCG class of algorithms for complex symmetric linear systems with applications in several electromagnetic model problems
- Complex conjugate gradient methods
- The complex dynamic of conjugate gradient method
- Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
- Fast structure-preserving difference algorithm for 2D nonlinear space-fractional wave models
- Experiments with search directions for a generalized CG method
- A finite volume framework for damage and fracture prediction in wire drawing
- Conjugate gradient acceleration of iteratively re-weighted least squares methods
- Choice of the perfectly matched layer boundary condition for frequency-domain Maxwell's equations solvers
- A variable metric method for approximating generalized inverses of matrices
- Some results on sparse block factorization iterative methods
- A Jacobian-free Newton-Krylov method for cell-centred finite volume solid mechanics
- Special issue: GAMM 2000. Annual meeting. Short communications in mathematics and mechanics, section 9-25. Univ. of Göttingen, Germany, April 2--7, 2000
- Incomplete block factorization preconditioning for linear systems arising in the numerical solution of the Helmholtz equation
This page was built for publication: A Generalization of the Conjugate-Gradient Method to Solve Complex Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4721520)
